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 A166660 #7 May 21 2016 22:34:54
%S A166660 1,5,7,25,11,35,15,125,49,55,23,175,27,75,77,625,35,245,39,275,105,
%T A166660 115,47,875,121,135,343,375,59,385,63,3125,161,175,165,1225,75,195,
%U A166660 189,1375,83,525,87,575,539,235,95,4375,225,605
%N A166660 Totally multiplicative sequence with a(p) = 2p+1 for prime p.
%H A166660 G. C. Greubel, <a href="/A166660/b166660.txt">Table of n, a(n) for n = 1..10000</a>
%F A166660 Multiplicative with a(p^e) = (2p+1)^e. If n = Product p(k)^e(k) then a(n) = Product (2*p(k)+1)^e(k).
%t A166660 a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((2*fi[[All, 1]] + 1)^fi[[All, 2]]) ); Table[a[n], {n, 1, 100}](* _G. C. Greubel_, May 21 2016 *)
%K A166660 nonn,mult
%O A166660 1,2
%A A166660 _Jaroslav Krizek_, Oct 18 2009