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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061603 n! / {product of factorials of the digits of n}. 2
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3628800, 39916800, 239500800, 1037836800, 3632428800, 10897286400, 29059430400, 70572902400, 158789030400, 335221286400, 1216451004088320000, 25545471085854720000, 281000181944401920000 (list; graph; refs; listen; history; internal format)
OFFSET

0,11

COMMENTS

It can be shown that the terms obtained by the above formula are positive integers using the fact that k! divides a product of k consecutive numbers.

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,100

EXAMPLE

a(12) = (12!) / { (1!)(2!) = 239500800.

PROG

(PARI) { for (n=0, 100, p=1; x=n; until (x==0, p*=(x - 10*(x\10))!; x\=10); write("b061603.txt", n, " ", n!/p) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Jul 25 2009]

CROSSREFS

Cf. A061602.

Sequence in context: A127229 A068158 A011521 * A153761 A133132 A179065

Adjacent sequences:  A061600 A061601 A061602 * A061604 A061605 A061606

KEYWORD

nonn,base,easy

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 19 2001

EXTENSIONS

Corrected and extended by Vladeta Jovovic (vladeta(AT)eunet.rs), May 19 2001

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 16 21:04 EST 2012. Contains 205969 sequences.