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 A123157 #7 Jul 05 2013 04:40:55
%S A123157 4,9,7,13,4,16,19,10,16,13,16,19,16,22,13,19,16,13,25,10,19,13,31,19,
%T A123157 22,4,16,19,19,25,19,16,31,16,7,13,25,28,34,31,10,19,22,25,28,19,16,
%U A123157 31,22,16,28,16,22,10,25,31,19,19,31,31,25,34,28,25,40,22,22,25,16,13,22,28
%N A123157 Sum of digits of the squares of prime numbers.
%H A123157 Albert Frank, <a href="http://www.paulcooijmans.com/oth/intcont2003.html">International Contest Of Logical Sequences</a>, 2002 - 2003. Item 11
%H A123157 Albert Frank, <a href="http://www.paulcooijmans.com/oth/intcont2003ans.html">Solutions of International Contest Of Logical Sequences</a>, 2002 - 2003.
%p A123157 read("transforms"):
%p A123157 A123157 := proc(n)
%p A123157 digsum(ithprime(n)^2) ;
%p A123157 end proc: # _R. J. Mathar_, Jul 05 2013
%t A123157 Total[IntegerDigits[#]]&/@(Prime[Range[80]]^2) (* _Harvey P. Dale_, Nov 04 2012 *)
%o A123157 (PARI) for(n=1,100,dp2=eval(Vec(Str(prime(n)^2)));print1(sum(i=1,length(dp2),dp2[i]),","))
%K A123157 nonn,base
%O A123157 1,1
%A A123157 Herman Jamke (hermanjamke(AT)fastmail.fm), Oct 01 2006