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

%I #7 Nov 21 2013 12:47:12

%S 6,15,33,60,69,96,132,177,204,249,285,312,339,384,411,447,483,528,573,

%T 609,654,699,735,780,807,852,888,915,960,996,1050,1077,1113,1176,1230,

%U 1266,1311,1338,1383,1437,1482,1527,1563,1608,1653,1698,1752,1797,1851

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

%t NestList[#+Total[IntegerDigits[#^3]]&,6,50] (* _Harvey P. Dale_, Aug 16 2011 *)

%Y Cf. A051373.

%K nonn,base,easy,less

%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 April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)