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

%I #9 Jun 15 2019 14:07:39

%S 3,12,30,39,66,102,120,138,165,192,237,255,291,318,345,372,417,444,

%T 489,525,552,597,633,669,714,759,804,849,885,921,966,1011,1038,1083,

%U 1128,1164,1218,1254,1299,1353,1407,1452,1488,1533,1578,1623,1668,1713,1758

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

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

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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 22 09:29 EDT 2024. Contains 373568 sequences. (Running on oeis4.)