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

%I #8 Mar 20 2021 13:57:37

%S 567,594,621,648,675,702,729,747,774,810,828,864,900,909,936,972,1008,

%T 1026,1053,1080,1098,1116,1143,1170,1197,1224,1260,1287,1323,1350,

%U 1368,1395,1422,1440,1458,1485,1503,1530,1548,1575,1602,1629,1656,1683,1719

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

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

%t NestList[#+Total[IntegerDigits[#^2]]&,567,50] (* _Harvey P. Dale_, Mar 20 2021 *)

%Y Cf. A033298.

%K nonn,base,easy,less

%O 1,1

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