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!)
A047899 a(1) = 7; for n > 0, a(n+1) = a(n) * sum of digits of a(n). 9

%I #16 Feb 17 2024 10:34:31

%S 7,49,637,10192,132496,3312400,43061200,688979200,33759980800,

%T 1755519001600,70220760064000,2387505842176000,138475338846208000,

%U 9693273719234560000,736688802661826560000,64828614634240737280000

%N a(1) = 7; for n > 0, a(n+1) = a(n) * sum of digits of a(n).

%H Reinhard Zumkeller, <a href="/A047899/b047899.txt">Table of n, a(n) for n = 1..250</a>

%F a(n+1) = A057147(a(n)). - _Reinhard Zumkeller_, Mar 19 2014

%o (Haskell)

%o a047899 n = a047899_list !! (n-1)

%o a047899_list = iterate a057147 7 -- _Reinhard Zumkeller_, Mar 19 2014

%Y Cf. A047892 (start=2), A047912 (start=3), A047897 (start=5), A047898 (start=6), A047900 (start=8), A047901 (start=9), A047902 (start=11).

%K nonn,base,easy

%O 1,1

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

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 March 28 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)