|
Search: id:A000581
|
|
|
| A000581 |
|
Binomial coefficients C(n,8). (Formerly M4626 N1976)
|
|
+0 18
|
|
| 1, 9, 45, 165, 495, 1287, 3003, 6435, 12870, 24310, 43758, 75582, 125970, 203490, 319770, 490314, 735471, 1081575, 1562275, 2220075, 3108105, 4292145, 5852925, 7888725, 10518300, 13884156, 18156204, 23535820, 30260340, 38608020
(list; graph; listen)
|
|
|
OFFSET
|
8,2
|
|
|
COMMENT
|
Figurate numbers based on 8-dimensional regular simplex. - Jonathan Vos Post (jvospost2(AT)yahoo.com), Nov 28 2004
a(n) = A110555(n+1,8). - Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Jul 27 2005
Comment from R. K. Guy, Oct 19, 2007: just as A005712 and A000574 are described as the coefficients of x^4 and x^5 in the expansion of (1+x+x^2)^n, so should this sequence be described as the coefficients of x^3 therein.
Product of 8 consecutive numbers divided by 8! - Artur Jasinski (grafix(AT)csl.pl), Dec 02 2007
In this sequence there are no primes - Artur Jasinski (grafix(AT)csl.pl), Dec 02 2007
With a different offset, number of n-permutations (n>=8) of 2 objects: u,v, with repetition allowed, containing exactly eight (8) u's. Example: a(1)=9 because we have uuuuuuuuv, uuuuuuuvu, uuuuuuvuu, uuuuuvuuu, uuuuvuuuu, uuuvuuuuu, uuvuuuuuu, uvuuuuuuu and vuuuuuuuu. - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 23 2008
|
|
REFERENCES
|
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.
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 828.
A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 196.
L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see vol. 2, p. 7.
J. C. P. Miller, editor, Table of Binomial Coefficients. Royal Society Mathematical Tables, Vol. 3, Cambridge Univ. Press, 1954.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=8..1000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, December 1972 [alternative scanned copy].
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.
P. J. Cameron, Sequences realized by oligomorphic permutation groups, J. Integ. Seqs. Vol. 3 (2000), #00.1.5.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 258
H. K. Kim, On Regular Polytope Numbers, Journal: Proc. Amer. Math. Soc. 131 (2003), 65-75, as PDF file.
J. V. Post, Table of Polytope Numbers, Sorted, Through 1,000,000.
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
FORMULA
|
G.f.: if offset 0: 1/(1-x)^9
(x^8-28*x^7+322*x^6-1960*x^5+6769*x^4-13132*x^3+13068*x^2-5040*x)/40320
a(n)=n(n+1)(n+2)(n+3)(n+4)(n+5)(n+6)(n+7)/8! - Artur Jasinski (grafix(AT)csl.pl), Dec 02 2007
|
|
MAPLE
|
ZL := [S, {S=Prod(B, B, B, B, B, B, B, B, B), B=Set(Z, 1 <= card)}, unlabeled]: seq(combstruct[count](ZL, size=n), n=9..38); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 13 2007
A000581:=-1/(z-1)**9; [Conjectured by S. Plouffe in his 1992 dissertation.]
seq(binomial(n+8, 8)*1^n, n=0..29); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 23 2008
|
|
MATHEMATICA
|
Table[n(n+1)(n+2)(n+3)(n+4)(n+5)(n+6)(n+7)/8!, {n, 1, 100}] - Artur Jasinski (grafix(AT)csl.pl), Dec 02 2007
|
|
CROSSREFS
|
Cf. A053137, A053130.
Cf. A000217, A000292, A000332, A000389, A000579, A000580.
Sequence in context: A008501 A008491 A023034 this_sequence A128643 A036826 A022574
Adjacent sequences: A000578 A000579 A000580 this_sequence A000582 A000583 A000584
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Larry Reeves (larryr(AT)acm.org), Mar 17 2000
|
|
|
Search completed in 0.003 seconds
|