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 A074373 #7 Aug 11 2014 22:45:22
%S A074373 0,4,9,16,25,25,49,36,36,49,121,49,169,81,64,64,289,64,361,81,100,169,
%T A074373 529,81,100,225,81,121,841,100,961,100,196,361,144,100,1369,441,256,
%U A074373 121,1681,144,1849,225,121,625,2209,121,196,144,400,289,2809,121,256
%N A074373 Square of the sum of the prime factors of n (with repetition).
%H A074373 Harvey P. Dale, <a href="/A074373/b074373.txt">Table of n, a(n) for n = 1..1000</a>
%H A074373 Neville Holmes, <a href="http://www.comp.utas.edu.au/users/nholmes/sqncs/cmbntns.htm#A074373">Integer Sequence Combinations</a>
%e A074373 a(12)=49 because 12=2*2*3, 2+2+3=7 and 7^2 = 49.
%t A074373 sspf[n_]:=Total[Flatten[Table[#[[1]],{#[[2]]}]&/@FactorInteger[ n]]]^2; Join[{0},Array[sspf,60,2]] (* _Harvey P. Dale_, Sep 24 2012 *)
%Y A074373 Equals A001414^2.
%K A074373 easy,nonn
%O A074373 1,2
%A A074373 _W. Neville Holmes_, Aug 28 2002