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 A066504 #14 Jan 03 2016 16:44:11
%S A066504 0,1,1,1,1,5,1,1,1,7,1,7,1,9,8,1,1,11,1,9,10,13,1,11,1,15,1,11,1,31,1,
%T A066504 1,14,19,12,13,1,21,16,13,1,41,1,15,14,25,1,19,1,27,20,17,1,29,16,15,
%U A066504 22,31,1,47,1,33,16,1,18,61,1,21,26,59,1,17,1,39,28,23,18,71,1,21,1,43,1
%N A066504 Sum of n/p^k over all maximal prime-power divisors of n.
%C A066504 a(A000961(m)) = 1; a(A001358(m)) = A008472(A001358(m)).
%D A066504 R. K. Guy, Unsolved Problems in Number Theory, B8.
%H A066504 Harry J. Smith, <a href="/A066504/b066504.txt">Table of n, a(n) for n = 1..1000</a>
%e A066504 a(120) = 120/2^3 + 120/3^1 + 120/5^1 = 15 + 40 + 24 = 79.
%t A066504 f[n_ ] := n*Plus @@ (1/#[[1]]^#[[2]] & /@ FactorInteger@n); Array[f, 83] (* _Robert G. Wilson v_ *)
%o A066504 (PARI) { for (n=1, 1000, f=factor(n); a=sum(i=1, matsize(f)[1], n/(f[i, 1]^f[i, 2])); write("b066504.txt", n, " ", a) ) } \\ _Harry J. Smith_, Feb 18 2010
%Y A066504 Cf. A005236.
%Y A066504 Cf. A028236. - _R. J. Mathar_, Sep 30 2008
%K A066504 nonn
%O A066504 1,6
%A A066504 _Reinhard Zumkeller_, Jan 04 2002
%E A066504 More terms from _Robert G. Wilson v_, Dec 06 2005