Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A008859
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A008859 Sum C(n,k), k=0..6. +0
8
1, 2, 4, 8, 16, 32, 64, 127, 247, 466, 848, 1486, 2510, 4096, 6476, 9949, 14893, 21778, 31180, 43796, 60460, 82160, 110056, 145499, 190051, 245506, 313912, 397594, 499178, 621616, 768212, 942649, 1149017, 1391842, 1676116, 2007328 (list; graph; listen)
OFFSET

0,2

REFERENCES

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 72, Problem 2.

FORMULA

a(n)=sum(binomial(n+1, 2k), k=0..3). - Len Smiley (smiley(AT)math.uaa.alaska.edu), Oct 20 2001

O.g.f.: -(1-5*x+11*x^2-13*x^3+9*x^4-3*x^5+x^6)/(-1+x)^7. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 02 2008

CROSSREFS

Cf. A008860, A008861, A008862, A008863, A006261, A000127.

Sequence in context: A069050 A059174 A054044 this_sequence A145113 A062257 A062258

Adjacent sequences: A008856 A008857 A008858 this_sequence A008860 A008861 A008862

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com) and R. K. Guy

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 December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research