login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052920 a(n) = a(n-3) + a(n-5). 0
1, 0, 0, 1, 0, 1, 1, 0, 2, 1, 1, 3, 1, 3, 4, 2, 6, 5, 5, 10, 7, 11, 15, 12, 21, 22, 23, 36, 34, 44, 58, 57, 80, 92, 101, 138, 149, 181, 230, 250, 319, 379, 431, 549, 629, 750, 928, 1060, 1299, 1557, 1810, 2227, 2617, 3109, 3784, 4427, 5336, 6401, 7536, 9120, 10828 (list; graph; refs; listen; history; internal format)
OFFSET

0,9

LINKS

INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 903

E. Wilson, The Scales of Mt. Meru

FORMULA

G.f.: 1/(1-x^3-x^5)

Recurrence: {a(1)=0, a(0)=1, a(2)=0, a(3)=1, a(4)=0, a(n)+a(n+2)-a(n+5)}

Sum(1/3233*(-60+100*_alpha^2+250*_alpha^4+661*_alpha+36*_alpha^3)*_alpha^(-1-n), _alpha=RootOf(-1+_Z^3+_Z^5))

MAPLE

spec := [S, {S=Sequence(Prod(Union(Z, Prod(Z, Z, Z)), Z, Z))}, unlabeled]: seq(combstruct[count](spec, size=n), n=0..20);

CROSSREFS

Sequence in context: A102426 A092865 A098925 * A089141 A170820 A003687

Adjacent sequences:  A052917 A052918 A052919 * A052921 A052922 A052923

KEYWORD

easy,nonn

AUTHOR

encyclopedia(AT)pommard.inria.fr, Jan 25 2000

EXTENSIONS

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jun 05 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 13 22:36 EST 2012. Contains 205567 sequences.