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!)
A137358 a(n) = Sum_{k <= n/2 } binomial(n-2k, 3k+2). 5
0, 0, 1, 3, 6, 10, 15, 22, 34, 57, 101, 181, 319, 549, 928, 1557, 2617, 4427, 7536, 12872, 21992, 37513, 63862, 108575, 184524, 313701, 533619, 908140, 1545839, 2631240, 4478044, 7619870, 12964858, 22058847, 37533077, 63865592, 108676262, 184929945, 314685488 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
REFERENCES
D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4.
LINKS
FORMULA
a(0)=0, a(1)=0, a(2)=1, a(3)=3, a(4)=6, a(n)=3*a(n-1)-3*a(n-2)+ a(n-3)+ a(n-5). - Harvey P. Dale, Nov 06 2012
G.f.: -x^2/(x^5+x^3-3*x^2+3*x-1). - Colin Barker, Jan 23 2013
MATHEMATICA
Table[Sum[Binomial[n-2k, 3k+2], {k, 0, Floor[n/2]}], {n, 0, 50}] (* or *) LinearRecurrence[{3, -3, 1, 0, 1}, {0, 0, 1, 3, 6}, 50] (* Harvey P. Dale, Nov 06 2012 *)
CROSSREFS
Sequence in context: A330910 A226239 A209231 * A143963 A139714 A342211
KEYWORD
nonn,easy
AUTHOR
Don Knuth, Apr 11 2008
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 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)