|
| |
|
|
A051189
|
|
Octo-factorial numbers.
|
|
14
| |
|
|
1, 8, 128, 3072, 98304, 3932160, 188743680, 10569646080, 676457349120, 48704929136640, 3896394330931200, 342882701121945600, 32916739307706777600, 3423340888001504870400, 383414179456168545484800
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| For n >= 1 a(n) is the order of the wreath product of the symmetric group S_n and the Abelian group (C_8)^n. - Ahmed Fares (ahmedfares(AT)my-deja.com), May 07 2001
Number of n X n monomial matrices whose nonzero entries are unit quaternions.
Number of ways of reassembling n slices of toast or of binding n square pages. - Donald S. McDonald (don.mcdonald(AT)paradise.net.nz), Sep 24 2005
|
|
|
LINKS
| Vincenzo Librandi, Table of n, a(n) for n = 0..300
Index entries for sequences related to factorial numbers
|
|
|
FORMULA
| a(n) = 8*A034976(n) = product(8*k, k=1..n), n >= 1; a(0) := 1.
a(n) = n!*8^n.
E.g.f. 1/(1-8*x)
G.f.: 1/(1-8x/(1-8x/(1-16x/(1-16x/(1-24x/(1-24x/(1-32x/(1-32x/(1-... (continued fraction). - DELEHAM Philippe, Jan 07 2012
|
|
|
MAPLE
| with(combstruct):A:=[N, {N=Cycle(Union(Z$8))}, labeled]: seq(count(A, size=n)/8, n=1..15); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 05 2007
|
|
|
MATHEMATICA
| s=1; lst={s}; Do[s+=n*s; AppendTo[lst, s], {n, 7, 5!, 8}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Nov 08 2008]
|
|
|
PROG
| (MAGMA) [8^n*Factorial(n): n in [0..20]]; // Vincenzo Librandi, Oct 05 2011
|
|
|
CROSSREFS
| Cf. A047058, A051188, A053115, A000165.
Sequence in context: A013777 A183497 A156270 * A113135 A188060 A104997
Adjacent sequences: A051186 A051187 A051188 * A051190 A051191 A051192
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de)
|
| |
|
|
