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

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

%I

%S 1,2,10,11,19,47,64,83,118,137,163,191,235,281,307,344,379,425,469,

%T 497,532,578,604,641,676,722,766,812,856,884,919,965,1009,1046,1081,

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

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

%H Harvey P. Dale, <a href="/A051373/b051373.txt">Table of n, a(n) for n = 1..1000</a>

%t NestList[#+Total[IntegerDigits[#^3]]&,1,50] (* _Harvey P. Dale_, Dec 25 2015 *)

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

%o lista(nn) = {na = 1; for (i=1, nn, print1(na, ", "); na += sod(na^3););} \\ _Michel Marcus_, Jun 22 2013

%Y Cf. A033298.

%K easy,nonn,base

%O 1,2

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

%E More terms from _James A. Sellers_, May 01 2000

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.

Last modified May 13 19:36 EDT 2021. Contains 343868 sequences. (Running on oeis4.)