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!)
A051409 a(n+1) = a(n) + sum of digits of (a(n)^3). 1

%I #6 Jun 22 2013 13:21:40

%S 4,14,31,59,85,104,130,149,184,212,247,275,319,356,382,428,463,509,

%T 544,590,616,662,697,743,769,815,850,869,913,959,1012,1049,1084,1121,

%U 1165,1202,1246,1292,1345,1382,1435,1499,1552,1598,1642,1679,1732,1787,1822

%N a(n+1) = a(n) + sum of digits of (a(n)^3).

%Y Cf. A051373.

%K easy,nonn,base

%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 July 22 13:40 EDT 2024. Contains 374499 sequences. (Running on oeis4.)