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!)
A051373 a(n+1) = a(n) + sum of digits of (a(n)^3). 9
1, 2, 10, 11, 19, 47, 64, 83, 118, 137, 163, 191, 235, 281, 307, 344, 379, 425, 469, 497, 532, 578, 604, 641, 676, 722, 766, 812, 856, 884, 919, 965, 1009, 1046, 1081, 1109, 1153, 1199, 1252, 1289, 1324, 1352, 1387, 1433, 1486, 1532, 1585, 1640, 1666, 1712 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Harvey P. Dale, Table of n, a(n) for n = 1..1000

MATHEMATICA

NestList[#+Total[IntegerDigits[#^3]]&, 1, 50] (* Harvey P. Dale, Dec 25 2015 *)

PROG

(PARI) sod(n) = d = digits(n); sum(i=1, #d, d[i])

lista(nn) = {na = 1; for (i=1, nn, print1(na, ", "); na += sod(na^3); ); } \\ Michel Marcus, Jun 22 2013

CROSSREFS

Cf. A033298.

Sequence in context: A032930 A033293 A231501 * A131096 A069263 A174569

Adjacent sequences:  A051370 A051371 A051372 * A051374 A051375 A051376

KEYWORD

easy,nonn,base

AUTHOR

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

EXTENSIONS

More terms from James A. Sellers, May 01 2000

STATUS

approved

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 August 14 13:43 EDT 2020. Contains 336481 sequences. (Running on oeis4.)