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 A167303 #12 Oct 18 2023 02:09:55
%S A167303 1,8,10,64,14,80,18,512,100,112,26,640,30,144,140,4096,38,800,42,896,
%T A167303 180,208,50,5120,196,240,1000,1152,62,1120,66,32768,260,304,252,6400,
%U A167303 78,336,300,7168,86,1440,90,1664,1400,400,98,40960,324,1568
%N A167303 Totally multiplicative sequence with a(p) = 2*(p+2) for prime p.
%H A167303 G. C. Greubel, <a href="/A167303/b167303.txt">Table of n, a(n) for n = 1..1000</a>
%F A167303 Multiplicative with a(p^e) = (2*(p+2))^e. If n = Product p(k)^e(k) then a(n) = Product (2*(p(k)+2))^e(k).
%F A167303 a(n) = A061142(n) * A166590(n) = 2^bigomega(n) * A166590(n) = 2^A001222(n) * A166590(n).
%t A167303 a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 2)^fi[[All, 2]])); Table[a[n]*2^PrimeOmega[n], {n, 1, 100}] (* _G. C. Greubel_, Jun 07 2016 *)
%t A167303 f[p_, e_] := (2*(p+2))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Oct 18 2023 *)
%Y A167303 Cf. A001222, A061142, A166590.
%K A167303 nonn,easy,mult
%O A167303 1,2
%A A167303 _Jaroslav Krizek_, Nov 01 2009