login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047897 a(1) = 5; for n > 0, a(n+1) = a(n) * sum of digits of a(n). 11
5, 25, 175, 2275, 36400, 473200, 7571200, 166566400, 5663257600, 226530304000, 5663257600000, 226530304000000, 5663257600000000, 226530304000000000, 5663257600000000000, 226530304000000000000, 5663257600000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
After a(9), every second element has the same beginning. a(11+2k) = 40 * a(10+2k) = 40 * 25 * a(9+2k).
LINKS
FORMULA
a(n+1) = A057147(a(n)). - Reinhard Zumkeller, Mar 19 2014
MATHEMATICA
NestList[#*Total[IntegerDigits[#]]&, 5, 20] (* Harvey P. Dale, Jan 25 2014 *)
PROG
(Haskell)
a047897 n = a047897_list !! (n-1)
a047897_list = iterate a057147 5 -- Reinhard Zumkeller, Mar 19 2014
CROSSREFS
Cf. A047892 (start=2), A047912 (start=3), A047898 (start=6), A047899 (start=7), A047900 (start=8), A047901 (start=9), A047902 (start=11).
Sequence in context: A258369 A137383 A049035 * A204461 A121144 A096684
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 20:26 EDT 2024. Contains 371781 sequences. (Running on oeis4.)