login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051262 10-factorial numbers. 4
1, 10, 200, 6000, 240000, 12000000, 720000000, 50400000000, 4032000000000, 362880000000000, 36288000000000000, 3991680000000000000, 479001600000000000000, 62270208000000000000000 (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_10)^n. - Ahmed Fares (ahmedfares(AT)my-deja.com), May 07 2001

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..300

Index entries for sequences related to factorial numbers

FORMULA

a(n) = 10*A035279, (n) = product(10*k, k=1..n), n >= 1; a(0) := 1.

a(n) = n!*10^n =: (10*n)(!^10);

E.g.f. 1/(1-10*x)

MAPLE

with(combstruct):A:=[N, {N=Cycle(Union(Z$10))}, labeled]: seq(count(A, size=n)/10, n=0..14); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 05 2007

PROG

(MAGMA) [10^n*Factorial(n): n in [0..20]]; // Vincenzo Librandi, Oct 05 2011

CROSSREFS

a(n) = A048176(n+1, 0)*(-1)^n (first column of unsigned triangle).

A047058, A051188, A051189, A051232, A035279.

Sequence in context: A202436 A156275 A036362 * A178020 A041183 A041180

Adjacent sequences:  A051259 A051260 A051261 * A051263 A051264 A051265

KEYWORD

easy,nonn

AUTHOR

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.