login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A033298
a(n+1) = a(n) + sum of digits of a(n)^2.
9
1, 2, 6, 15, 24, 42, 60, 69, 87, 114, 141, 168, 186, 213, 240, 258, 285, 303, 330, 348, 357, 384, 411, 438, 465, 483, 510, 519, 546, 573, 600, 609, 636, 663, 699, 726, 753, 780, 798, 825, 852, 879, 906, 933, 969, 1005, 1014, 1041, 1068, 1086
OFFSET
1,2
LINKS
EXAMPLE
a(6) = 42 as a(5) = 24 giving a(6) = 24 + (sum of digits of 24^2 = 576) = 24 + 5 + 7 + 6 = 42. - David A. Corneth, Jun 26 2022
MATHEMATICA
NestList[#+Total[IntegerDigits[#^2]]&, 1, 50] (* Harvey P. Dale, Sep 21 2023 *)
PROG
(PARI) first(n) = {n=max(n, 1); my(res=vector(n)); res[1] = 1; for(i = 2, n, res[i] = res[i-1] + sumdigits(res[i-1]^2)); res} \\ David A. Corneth, Jun 26 2022
CROSSREFS
Partial sums of A139417.
Sequence in context: A349687 A090979 A050508 * A153274 A091766 A269706
KEYWORD
nonn,base,easy,less
AUTHOR
Miklos SZABO (mike(AT)ludens.elte.hu)
STATUS
approved