|
Search: id:A006261
|
|
|
| A006261 |
|
Sum_{ k = 0..5 } C(n,k).
(Formerly M1126)
|
|
+0
9
|
|
| 1, 2, 4, 8, 16, 32, 63, 120, 219, 382, 638, 1024, 1586, 2380, 3473, 4944, 6885, 9402, 12616, 16664, 21700, 27896, 35443, 44552, 55455, 68406, 83682, 101584, 122438, 146596, 174437, 206368, 242825, 284274, 331212, 384168, 443704
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 72, Problem 2.
M. L. Cornelius, Variations on a geometric progression, Mathematics in School, 4 (No. 3, May 1975), p. 32.
|
|
LINKS
|
S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures}, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.
|
|
FORMULA
|
a(n)=binomial(n+1, 5)+binomial(n+1, 3)+binomial(n+1, 1). - Len Smiley (smiley(AT)math.uaa.alaska.edu), Oct 20 2001
|
|
MAPLE
|
A006261:=(z**2-z+1)*(3*z**2-3*z+1)/(z-1)**6; [S. Plouffe in his 1992 dissertation.]
|
|
CROSSREFS
|
A057703(n) + 1.
Sequence in context: A054043 A052396 A051040 this_sequence A062259 A001949 A001592
Adjacent sequences: A006258 A006259 A006260 this_sequence A006262 A006263 A006264
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
