Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092493
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A092493 a(n)=4a(n-1)-4a(n-2)+3a(n-3)+a(n-4)-a(n-5). +0
1
1, 2, 5, 14, 42, 128, 389, 1179, 3572, 10825, 32810, 99446, 301412, 913547, 2768863, 8392136, 25435699, 77092976, 233660832, 708201794, 2146486339, 6505777953, 19718339694, 59764246943, 181139247400, 549014312524, 1664005563066 (list; graph; listen)
OFFSET

1,2

COMMENT

Arises in enumeration of certain pattern-avoiding permutations.

REFERENCES

Z. Stankova and J. West, Explicit enumeration of 321, hexagon-avoiding permutations, Discrete Math., 280 (2004), 165-189.

MAPLE

a[1]:=1: a[2]:=2: a[3]:=5: a[4]:=14: a[5]:=42: for n from 6 to 32 do a[n]:=4*a[n-1]-4*a[n-2]+3*a[n-3]+a[n-4]-a[n-5] od: seq(a[j], j=1..32); (Deutsch)

CROSSREFS

Cf. A058094, A092489-A092492.

Adjacent sequences: A092490 A092491 A092492 this_sequence A092494 A092495 A092496

Sequence in context: A000660 A025274 A132833 this_sequence A080937 A054392 A006930

KEYWORD

nonn,easy

AUTHOR

njas, Apr 04 2004

EXTENSIONS

Edited by Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 12 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 09:05 EDT 2008. Contains 145008 sequences.


AT&T Labs Research