Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A008861
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A008861 Sum C(n,k), k=0..8. +0
7
1, 2, 4, 8, 16, 32, 64, 128, 256, 511, 1013, 1981, 3797, 7099, 12911, 22819, 39203, 65536, 106762, 169766, 263950, 401930, 600370, 880970, 1271626, 1807781, 2533987, 3505699, 4791323, 6474541, 8656937, 11460949, 15033173, 19548046 (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..4), compare A008859.

CROSSREFS

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

Sequence in context: A009694 A097000 A054046 this_sequence A104144 A123464 A113019

Adjacent sequences: A008858 A008859 A008860 this_sequence A008862 A008863 A008864

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 July 19 08:04 EDT 2008. Contains 142098 sequences.


AT&T Labs Research