cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A051372 a(n+1) = a(n) + sum of digits of a(n)^2, with a(1) = 567.

This page as a plain text file.
%I A051372 #12 Mar 19 2025 18:44:30
%S A051372 567,594,621,648,675,702,729,747,774,810,828,864,900,909,936,972,1008,
%T A051372 1026,1053,1080,1098,1116,1143,1170,1197,1224,1260,1287,1323,1350,
%U A051372 1368,1395,1422,1440,1458,1485,1503,1530,1548,1575,1602,1629,1656,1683,1719
%N A051372 a(n+1) = a(n) + sum of digits of a(n)^2, with a(1) = 567.
%H A051372 Harvey P. Dale, <a href="/A051372/b051372.txt">Table of n, a(n) for n = 1..1000</a>
%t A051372 NestList[#+Total[IntegerDigits[#^2]]&,567,50] (* _Harvey P. Dale_, Mar 20 2021 *)
%Y A051372 Cf. A033298.
%K A051372 nonn,base,easy,less
%O A051372 1,1
%A A051372 Miklos SZABO (mike(AT)ludens.elte.hu)