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.
%I A139417 #15 Jun 16 2021 09:55:56
%S A139417 1,1,4,9,9,18,18,9,18,27,27,27,18,27,27,18,27,18,27,18,9,27,27,27,27,
%T A139417 18,27,9,27,27,27,9,27,27,36,27,27,27,18,27,27,27,27,27,36,36,9,27,27,
%U A139417 18,36,36,27,18,27,18,27,27,27,27,36,36,27,18,36,27,36
%N A139417 Sum of digits of the square of the sum of the preceding numbers.
%C A139417 As soon as a term is 9 or multiple of 9, which is true for a(4), all following ones are also multiple of 9, which never occurs in A065075.
%t A139417 nxt[{t_,a_}]:=Module[{c=Total[IntegerDigits[t^2]]},{t+c,c}]; NestList[ nxt,{1,1},70][[All,2]] (* _Harvey P. Dale_, Jun 15 2021 *)
%o A139417 (Python)
%o A139417 def sd(n): return sum(map(int, str(n)))
%o A139417 def aupton(terms):
%o A139417 alst, s = [1], 1
%o A139417 for n in range(2, terms+1): alst.append(sd(s**2)); s += alst[-1]
%o A139417 return alst
%o A139417 print(aupton(67)) # _Michael S. Branicky_, Jun 15 2021
%Y A139417 Cf. A065075.
%K A139417 base,easy,nonn
%O A139417 1,3
%A A139417 Philippe Lallouet (philip.lallouet(AT)orange.fr), Apr 20 2008
%E A139417 Corrected and extended by _Harvey P. Dale_, Jun 15 2021