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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A034879 a(n) = product of factorials of digits of a(n-1). 2
3, 6, 720, 10080, 40320, 288, 3251404800, 33443020800, 10032906240, 150493593600, 1179600089304268800000, 6494947622660923209343932825600000000, 817033558319976619871285124179533435912396304547840000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

The next term has 110 digits. - Harvey P. Dale, Oct 17 2011

LINKS

Table of n, a(n) for n=1..13.

FORMULA

a(n+1) = A066459(a(n)), a(1) = 3. - Reinhard Zumkeller, Oct 11 2011

MATHEMATICA

NestList[Times@@(IntegerDigits[#]!)&, 3, 12] (* Harvey P. Dale, Oct 17 2011 *)

PROG

(Haskell)

a034879 n = a034879_list !! (n-1)

a034879_list = iterate a066459 3  -- Reinhard Zumkeller, Oct 11 2011

CROSSREFS

Sequence in context: A157540 A179267 A171928 * A113588 A071106 A157548

Adjacent sequences:  A034876 A034877 A034878 * A034880 A034881 A034882

KEYWORD

nonn,base,nice

AUTHOR

Erich Friedman

EXTENSIONS

a(13) from Harvey P. Dale, Oct 17 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 22 00:25 EDT 2019. Contains 323472 sequences. (Running on oeis4.)