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

%I #8 Aug 13 2015 14:39:58

%S 8,18,27,45,54,72,90,99,117,144,162,180,189,207,234,261,279,306,333,

%T 360,378,405,423,459,477,504,522,549,558,576,603,630,657,684,720,738,

%U 765,792,819,846,873,900,909,936,972,1008,1026,1053,1080,1098,1116

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

%t NestList[#+Total[IntegerDigits[#^2]]&,8,50] (* _Harvey P. Dale_, Aug 13 2015 *)

%Y Cf. A033298.

%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 19 08:45 EDT 2024. Contains 371782 sequences. (Running on oeis4.)