login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092492 Arises in enumeration of 321-hexagon-avoiding permutations. 6
0, 0, 0, 0, 0, 1, 5, 19, 68, 240, 839, 2911, 10054, 34641, 119203, 409893, 1408873, 4841373, 16634350, 57149111, 196333312, 674477710, 2317047808, 7959739375, 27343914410, 93933688630, 322686958885, 1108513737048, 3808031504891 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,7
LINKS
Z. Stankova and J. West, Explicit enumeration of 321, hexagon-avoiding permutations, Discrete Math., 280 (2004), 165-189.
FORMULA
a(n) = 2*A058094(n-3) - 5*A058094(n-4) + A058094(n-5) for n >= 6. - Emeric Deutsch, Jun 08 2004
From Colin Barker, Aug 21 2019: (Start)
G.f.: x^6*(1 - x) / (1 - 6*x + 11*x^2 - 9*x^3 + 4*x^4 + 4*x^5 - x^6).
a(n) = 6*a(n-1) - 11*a(n-2) + 9*a(n-3) - 4*a(n-4) - 4*a(n-5) + a(n-6) for n>7.
(End)
MAPLE
b[1]:=1: b[2]:=2: b[3]:=5: b[4]:=14: b[5]:=42: b[6]:=132: for n from 6 to 45 do b[n+1]:=6*b[n]-11*b[n-1]+9*b[n-2]-4*b[n-3]-4*b[n-4]+b[n-5] od: a[1]:=0: a[2]:=0: a[3]:=0: a[4]:=0: a[5]:=0: for n from 6 to 40 do a[n]:=2*b[n-3]-5*b[n-4]+b[n-5] od: seq(a[n], n=1..40); # Emeric Deutsch, Jun 08 2004
PROG
(PARI) concat([0, 0, 0, 0, 0], Vec(x^6*(1 - x) / (1 - 6*x + 11*x^2 - 9*x^3 + 4*x^4 + 4*x^5 - x^6) + O(x^30))) \\ Colin Barker, Aug 21 2019
CROSSREFS
Sequence in context: A104496 A001435 A359293 * A070857 A143954 A047145
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Apr 04 2004
EXTENSIONS
More terms from Emeric Deutsch, Jun 08 2004
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 10 20:32 EDT 2024. Contains 372388 sequences. (Running on oeis4.)