cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A034879 a(n) = product of factorials of digits of a(n-1).

Original entry on oeis.org

3, 6, 720, 10080, 40320, 288, 3251404800, 33443020800, 10032906240, 150493593600, 1179600089304268800000, 6494947622660923209343932825600000000, 817033558319976619871285124179533435912396304547840000000000000
Offset: 1

Views

Author

Keywords

Comments

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

Programs

  • Haskell
    a034879 n = a034879_list !! (n-1)
    a034879_list = iterate a066459 3  -- Reinhard Zumkeller, Oct 11 2011
  • Mathematica
    NestList[Times@@(IntegerDigits[#]!)&,3,12] (* Harvey P. Dale, Oct 17 2011 *)

Formula

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

Extensions

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