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

%I

%S 197,225,243,270,288,315,342,369,387,423,459,477,504,522,549,558,576,

%T 603,630,657,684,720,738,765,792,819,846,873,900,909,936,972,1008,

%U 1026,1053,1080,1098,1116,1143,1170,1197,1224,1260,1287,1323,1350,1368,1395

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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 14 05:10 EDT 2021. Contains 345018 sequences. (Running on oeis4.)