|
Search: id:A005288
|
|
|
| A005288 |
|
C(n,5)+C(n,4)-C(n,3)+1, n >= 7.
(Formerly M3090)
|
|
+0
3
|
|
| 3, 22, 71, 169, 343, 628, 1068, 1717, 2640, 3914, 5629, 7889, 10813, 14536, 19210, 25005, 32110, 40734, 51107, 63481, 78131, 95356, 115480, 138853, 165852, 196882, 232377, 272801, 318649, 370448, 428758, 494173, 567322
(list; graph; listen)
|
|
|
OFFSET
|
6,1
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
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.
F. N. David, M. G. Kendall and D. E. Barton, Symmetric Function and Allied Tables, Cambridge, 1966, p. 241.
D. E. Knuth, The Art of Computer Programming. Addison-Wesley, Reading, MA, Vol. 3, p. 15.
R. H. Moritz and R. C. Williams, A coin-tossing problem and some related combinatorics, Math. Mag., 61 (1988), 24-29.
E. Netto, Lehrbuch der Combinatorik. 2nd ed., Teubner, Leipzig, 1927, p. 96.
|
|
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
|
C(n+3, 5)-C(n+2, 3)+C(n, 0).
|
|
MAPLE
|
A005288:=(3+4*z-16*z**2+13*z**3-z**4-3*z**5+z**6)/(z-1)**6; [Conjectured by S. Plouffe in his 1992 dissertation.]
|
|
CROSSREFS
|
Cf. A008302.
Sequence in context: A104604 A139272 A006532 this_sequence A143166 A055550 A075204
Adjacent sequences: A005285 A005286 A005287 this_sequence A005289 A005290 A005291
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
