|
Search: id:A008860
|
|
| |
|
| 1, 2, 4, 8, 16, 32, 64, 128, 255, 502, 968, 1816, 3302, 5812, 9908, 16384, 26333, 41226, 63004, 94184, 137980, 198440, 280600, 390656, 536155, 726206, 971712, 1285624, 1683218, 2182396, 2804012, 3572224, 4514873, 5663890, 7055732
(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-1 ) for k=1..4 ) = ( n^6 -14*n^5 +112*n^4 -350*n^3 +1099*n^2 +364*n +3828 )*n/5040 +1.
|
|
CROSSREFS
|
Cf. A008859, A008861, A008862, A008863, A006261, A000127.
Sequence in context: A009641 A089889 A054045 this_sequence A079262 A087079 A009694
Adjacent sequences: A008857 A008858 A008859 this_sequence A008861 A008862 A008863
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas, R. K. Guy
|
|
EXTENSIONS
|
Len Smiley's formula for A006261 copied by frank.ellermann(AT)t-online.de
|
|
|
Search completed in 0.002 seconds
|
