A047902 a(1) = 11; for n > 0, a(n+1) = a(n) * sum of digits of a(n).

11, 22, 88, 1408, 18304, 292864, 9078784, 390387712, 15615508480, 671466864640, 38945078149120, 2375649767096320, 180549382299320320, 12638456760952422400, 960522713832384102400, 67236589968266887168000

Offset: 1

Author

Miklos SZABO (mike(AT)ludens.elte.hu)

Keywords

• easy
• nonn
• base

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..250

Crossrefs

Cf. A047892 (start=2), A047912 (start=3), A047897 (start=5), A047898 (start=6), A047899 (start=7), A047900 (start=8), A047901 (start=9).

Programs

Haskell

a047902 n = a047902_list !! (n-1)
a047902_list = iterate a057147 11  -- Reinhard Zumkeller, Mar 19 2014

Formula

a(n+1) = A057147(a(n)). - Reinhard Zumkeller, Mar 19 2014