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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A139748 Sum_{ k >= 0} binomial(n,5*k+3). 4
0, 0, 0, 1, 4, 10, 20, 35, 57, 93, 165, 330, 715, 1574, 3381, 6995, 13990, 27370, 53143, 103702, 204820, 409640, 826045, 1669801, 3368259, 6765175, 13530350, 26985675, 53774932, 107232053, 214146295, 428292590, 857417220, 1717012749, 3437550076 (list; graph; refs; listen; history; internal format)
OFFSET

0,5

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), a(n), A139714(n), A133476(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]; sum = 64. (End)

LINKS

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

FORMULA

G.f.:x^3*(x-1)/((2*x-1)*(x^4-2*x^3+4*x^2-3*x+1)) [From Maksym Voznyy (voznyy(AT)mail.ru), Aug 12 2009]

CROSSREFS

Sequence in context: A038419 A057319 A034223 * A137359 A134987 A058539

Adjacent sequences:  A139745 A139746 A139747 * A139749 A139750 A139751

KEYWORD

nonn

AUTHOR

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

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 16 10:28 EST 2012. Contains 205904 sequences.