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 A166663 #8 May 22 2016 12:56:25
%S A166663 1,11,16,121,26,176,36,1331,256,286,56,1936,66,396,416,14641,86,2816,
%T A166663 96,3146,576,616,116,21296,676,726,4096,4356,146,4576,156,161051,896,
%U A166663 946,936,30976,186,1056,1056,34606,206,6336,216,6776,6656,1276,236,234256
%N A166663 Totally multiplicative sequence with a(p) = 5p+1 for prime p.
%H A166663 G. C. Greubel, <a href="/A166663/b166663.txt">Table of n, a(n) for n = 1..10000</a>
%F A166663 Multiplicative with a(p^e) = (5p+1)^e. If n = Product p(k)^e(k) then a(n) = Product (5*p(k)+1)^e(k).
%t A166663 a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((5*fi[[All, 1]] + 1)^fi[[All, 2]])); Table[a[n], {n, 1, 100}] (* _G. C. Greubel_, May 22 2016 *)
%K A166663 nonn,mult
%O A166663 1,2
%A A166663 _Jaroslav Krizek_, Oct 18 2009