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

%I #6 Jun 18 2013 11:48:01

%S 46,74,91,119,154,182,217,236,262,308,334,371,397,434,469,497,532,578,

%T 604,641,676,722,766,812,856,884,919,965,1009,1046,1081,1109,1153,

%U 1199,1252,1289,1324,1352,1387,1433,1486,1532,1585,1640,1666,1712,1756,1802

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

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

%t NestList[#+Total[IntegerDigits[#^3]]&,46,50] (* _Harvey P. Dale_, Jun 18 2013 *)

%Y Cf. A051373.

%K nonn,base,easy,less

%O 1,1

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

%E Definition clarified by _Harvey P. Dale_, Jun 18 2013

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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)