Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A008863
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A008863 Sum C(n,k), k=0..10. +0
7
1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2047, 4083, 8100, 15914, 30827, 58651, 109294, 199140, 354522, 616666, 1048576, 1744436, 2842226, 4540386, 7119516, 10970272, 16628809, 24821333, 36519556, 53009102, 75973189, 107594213 (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..5), compare A008859.

CROSSREFS

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

Sequence in context: A122265 A113010 A056767 this_sequence A145117 A133025 A118655

Adjacent sequences: A008860 A008861 A008862 this_sequence A008864 A008865 A008866

KEYWORD

nonn

AUTHOR

njas, 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 4 14:15 EST 2008. Contains 151279 sequences.


AT&T Labs Research