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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133476 Sum_{ k >= 0} binomial(n,5*k+1). 6
0, 1, 2, 3, 4, 5, 7, 14, 36, 93, 220, 474, 948, 1807, 3381, 6385, 12393, 24786, 50559, 103702, 211585, 427351, 854702, 1698458, 3368259, 6690150, 13333932, 26667864, 53457121, 107232053, 214978335, 430470899, 860941798, 1720537327, 3437550076, 6869397265 (list; graph; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Contribution from Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 14 2009: (Start)

M^n * [1,0,0,0,0] = [A139398(n), A139761(n), A139748(n), A139714(n), a(n)]

where M = a 5x5 matrix [1,1,0,0,0; 0,1,1,0,0; 0,0,1,1,0; 0,0,0,1,1; 1,0,0,0,1]

Sum of terms = 2^n. Example: M^6 * [1,0,0,0,0] = [7, 15, 20, 15, 7] = 2^6 = 64. (End)

LINKS

Index to sequences with linear recurrences with constant coefficients, signature (5,-10,10,-5,2).

FORMULA

a(n)=5a(n-1)-10a(n-2)+10a(n-3)-5a(n-4)+2a(n-5).

Sequence is identical to its fifth differences.

O.g.f.: x*(x-1)^3/((2*x-1)*(x^4-2*x^3+4*x^2-3*x+1)) = (1/5)*(3*x^3-7*x^2+6*x-1)/(x^4-2*x^3+4*x^2-3*x+1)-(1/5)/(2*x-1) . - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Nov 30 2007

Starting (1, 2, 3, 4, 5, 7,...) = binomial transform of (1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1,...). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Jul 03 2008

CROSSREFS

Cf. A049016.

Sequence in context: A048317 A037398 A048331 * A131023 A069514 A101012

Adjacent sequences:  A133473 A133474 A133475 * A133477 A133478 A133479

KEYWORD

nonn

AUTHOR

Paul Curtz (bpcrtz(AT)free.fr), Nov 29 2007

EXTENSIONS

Better definition from N. J. A. Sloane (njas(AT)research.att.com), Jun 13 2008

Edited by N. J. A. Sloane (njas(AT)research.att.com), Jul 02 2008 at the suggestion of R. J. Mathar

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 15 05:15 EST 2012. Contains 205694 sequences.