|
| |
|
|
A059860
|
|
Binomial(n+1,2)^5.
|
|
7
| |
|
|
1, 243, 7776, 100000, 759375, 4084101, 17210368, 60466176, 184528125, 503284375, 1252332576, 2887174368, 6240321451, 12762815625, 24883200000, 46525874176, 83841135993, 146211169851, 247609900000, 408410100000
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Number of 5-dimensional cage assemblies.
See Chap. 61, "Hyperspace Prisons", of C. Pickover's book "Wonders of Numbers" for full explanation of "cage numbers."
|
|
|
REFERENCES
| C. Pickover, Wonders of Numbers, Oxford University Press, 2001, p. 325.
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
C. A. Pickover, "Wonders of Numbers, Adventures in Mathematics, Mind and Meaning," Zentralblatt review
|
|
|
FORMULA
| L(n) = ((n^m)(n + 1)^m)/(2^m) where m is the dimension.
|
|
|
MAPLE
| for n from 1 to 100 do printf(`%d, `, ((n^5)*(n + 1)^5)/(2^5) ) od:
with (combinat):seq(mul(stirling2(n+1, n), k=1..5), n=1..21); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 14 2007
|
|
|
MATHEMATICA
| m = 5; Table[ ( (n^m)(n + 1)^m )/(2^m), {n, 1, 26} ]
|
|
|
PROG
| (PARI) { for (n=1, 1000, write("b059860.txt", n, " ", (n*(n + 1)/2)^5); ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 29 2009]
|
|
|
CROSSREFS
| Cf. A059827.
Sequence in context: A029700 A183808 A016769 * A016841 A128833 A016889
Adjacent sequences: A059857 A059858 A059859 * A059861 A059862 A059863
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Jason Earls (zevi_35711(AT)yahoo.com), Feb 28 2001
|
|
|
EXTENSIONS
| More terms from James A. Sellers (sellersj(AT)math.psu.edu), Feb 28 2001
Better definition from Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 23 2006
Corrected the definition from binomial(n+2,2)^5 to binomial(n+1,2)^5 Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jun 29 2009
|
| |
|
|
