The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A047902 a(1) = 11; for n > 0, a(n+1) = a(n) * sum of digits of a(n). 11
 11, 22, 88, 1408, 18304, 292864, 9078784, 390387712, 15615508480, 671466864640, 38945078149120, 2375649767096320, 180549382299320320, 12638456760952422400, 960522713832384102400, 67236589968266887168000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..250 FORMULA a(n+1) = A057147(a(n)). - Reinhard Zumkeller, Mar 19 2014 MAPLE P:=proc(n) local a, i, k, w; a:=11; print(a); for i from 1 by 1 to n do w:=0; k:=a; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; a:=a*w; print(a); od; end: P(1000); # Paolo P. Lava, Apr 27 2007 PROG (Haskell) a047902 n = a047902_list !! (n-1) a047902_list = iterate a057147 11  -- Reinhard Zumkeller, Mar 19 2014 CROSSREFS Cf. A047892 (start=2), A047912 (start=3), A047897 (start=5), A047898 (start=6), A047899 (start=7), A047900 (start=8), A047901 (start=9). Sequence in context: A109687 A225361 A111696 * A081930 A143964 A034708 Adjacent sequences:  A047899 A047900 A047901 * A047903 A047904 A047905 KEYWORD easy,nonn,base AUTHOR Miklos SZABO (mike(AT)ludens.elte.hu) 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.

Last modified June 22 03:15 EDT 2021. Contains 345367 sequences. (Running on oeis4.)