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 A166654 #8 May 21 2016 17:09:29
%S A166654 1,9,14,81,24,126,34,729,196,216,54,1134,64,306,336,6561,84,1764,94,
%T A166654 1944,476,486,114,10206,576,576,2744,2754,144,3024,154,59049,756,756,
%U A166654 816,15876,184,846,896,17496,204,4284,214,4374,4704,1026,234,91854,1156
%N A166654 Totally multiplicative sequence with a(p) = 5p-1 for prime p.
%H A166654 G. C. Greubel, <a href="/A166654/b166654.txt">Table of n, a(n) for n = 1..10000</a>
%F A166654 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 A166654 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 21 2016 *)
%K A166654 nonn,mult
%O A166654 1,2
%A A166654 _Jaroslav Krizek_, Oct 18 2009