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 A056528 #8 Mar 07 2018 19:22:25
%S A056528 1,7,9,13,13,9,16,1,9,1,7,9,13,13,9,16,10,9,1,7,9,13,13,9,16,10,9,10,
%T A056528 16,9,13,13,9,16,1,9,10,16,9,13,13,9,16,10,9,1,16,9,13,13,9,16,10,9,1,
%U A056528 16,9,13,13,9,16,10,18,10,16,9,13,13,9,16,1,9,10,16,9,13,13,9,16,1,9
%N A056528 Sum of digits of square of sum of digits of square.
%F A056528 a(n)=A004159(A004159(n))
%e A056528 a(2)=7 because sum of digits of square of 2 is 4 and sum of digits of square of 4 is 1+6=7
%t A056528 Array[Total[IntegerDigits[(Total[IntegerDigits[#^2]])^2]]&,90] (* _Harvey P. Dale_, Jan 17 2012 *)
%t A056528 Table[Nest[Total[IntegerDigits[#^2]]&,n,2],{n,90}] (* _Harvey P. Dale_, Mar 07 2018 *)
%Y A056528 Cf. A004159 for sum of digits of square, A056020 where iteration settles to 1, A056020 where iteration settles to 9, A056527 where iteration settles to 13 and 16. See also A056529.
%K A056528 base,easy,nonn
%O A056528 1,2
%A A056528 _Henry Bottomley_, Jun 19 2000