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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A053308 Partial sums of A053296. 4
1, 9, 46, 175, 551, 1518, 3785, 8735, 18955, 39130, 77533, 148487, 276408, 502415, 895103, 1568062, 2708322, 4622488, 7811510, 13091798, 21791338, 36067176, 59419294, 97522270, 159571139, 260459265, 424302452, 690141333 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

REFERENCES

A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 189, 194-196.

FORMULA

a(n)=sum{C(n+8-i, n-2i; i=0 to [n/2]}; n >= 0; [x]=greatest integer in x.

a(n)=Sum_{k=1..n}{C(n-k+8,k+7)}, with n>=0 - Paolo P. Lava (paoloplava(AT)gmail.com), Apr 16 2008

EXAMPLE

a(n)=a(n-1)+a(n-2)+C(n+7,7); n >= 0; a(-1)=0.

MATHEMATICA

lst={}; s0=s1=s2=s3=s4=s5=s6=s7=0; Do[s0+=a[n]; s1+=s0; s2+=s1; s3+=s2; s4+=s3; s5+=s4; s6+=s5; s7+=s6; AppendTo[lst, s7], {n, 0, 6!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 10 2008]

CROSSREFS

Cf. A053296, A053295, A000045.

Sequence in context: A009294 A061620 A001781 * A201458 A034487 A035039

Adjacent sequences:  A053305 A053306 A053307 * A053309 A053310 A053311

KEYWORD

easy,nonn

AUTHOR

Barry E. Williams, Mar 06 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 16 21:17 EST 2012. Contains 205971 sequences.