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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051414 a(n+1) = a(n) + sum of digits of a(n)^3. 1

%I

%S 145,173,208,254,289,326,370,389,442,488,514,560,586,605,631,668,712,

%T 749,793,848,883,938,982,1037,1072,1109,1153,1199,1252,1289,1324,1352,

%U 1387,1433,1486,1532,1585,1640,1666,1712,1756,1802,1846,1892,1945,2000

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

%C Elements >= 1109 can be found in A051373.

%t NestList[#+Total[IntegerDigits[#^3]]&,145,50] (* _Harvey P. Dale_, Jan 09 2011 *)

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 05:34 EDT 2021. Contains 343199 sequences. (Running on oeis4.)