Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053739
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A053739 Partial sums of A014166. +0
7
1, 6, 22, 63, 155, 344, 709, 1383, 2587, 4685, 8273, 14323, 24416, 41119, 68595, 113590, 187030, 306605, 500950, 816410, 1327986, 2157046, 3499982, 5674578, 9195035, 14893364, 24115804, 39040633 (list; graph; listen)
OFFSET

0,2

REFERENCES

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

FORMULA

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

a(n)=Sum_{k=1..n}{C(n-k+5,k+4)}, with n>=0 - Paolo P. Lava (ppl(AT)spl.at), Apr 16 2008

EXAMPLE

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

CROSSREFS

Cf. A014166 and A000045.

Right-hand column 10 of triangle A011794.

Sequence in context: A081282 A001769 A120477 this_sequence A055797 A001925 A002663

Adjacent sequences: A053736 A053737 A053738 this_sequence A053740 A053741 A053742

KEYWORD

easy,nonn

AUTHOR

Barry E. Williams, Feb 13 2000

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 4 18:25 EDT 2008. Contains 140886 sequences.


AT&T Labs Research