|
Search: id:A047892
|
|
|
| A047892 |
|
a(n+1) = a(n) * sum of digits of a(n). |
|
+0
15
|
|
| 2, 4, 16, 112, 448, 7168, 157696, 5361664, 166211584, 5651193856, 276908498944, 19383594926080, 1298700860047360, 79220752462888960, 6733763959345561600, 592571228422409420800, 45035413360103115980800
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
a(n) mod 9 = A010712(n-1) for n>0. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 23 2007
|
|
MAPLE
|
P:=proc(n) local a, i, k, w; a:=2; 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 (ppl(AT)spl.at), Apr 27 2007
|
|
CROSSREFS
|
Cf. A004207.
Cf. A007953.
Sequence in context: A066318 A135249 A110365 this_sequence A009200 A073924 A061588
Adjacent sequences: A047889 A047890 A047891 this_sequence A047893 A047894 A047895
|
|
KEYWORD
|
nonn,base,easy,nice
|
|
AUTHOR
|
Miklos SZABO (mike(AT)ludens.elte.hu)
|
|
|
Search completed in 0.002 seconds
|
