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!)
A092493 a(n) = 4a(n-1) - 4a(n-2) + 3a(n-3) + a(n-4) - a(n-5). 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; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Arises in enumeration of certain pattern-avoiding permutations.
LINKS
Z. Stankova and J. West, Explicit enumeration of 321, hexagon-avoiding permutations, Discrete Math., 280 (2004), 165-189.
FORMULA
G.f.: x*(1 - 2*x + x^2 - x^3 - x^4)/(1 - 4*x + 4*x^2 - 3*x^3 - x^4 + x^5). [Maksym Voznyy (voznyy(AT)mail.ru), Aug 12 2009; corrected by R. J. Mathar, Sep 16 2009]
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); # Emeric Deutsch, Apr 12 2005
CROSSREFS
Sequence in context: A293347 A148326 A148327 * A316779 A344571 A148328
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Apr 04 2004
EXTENSIONS
Edited by Emeric Deutsch, Apr 12 2005
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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)