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 A167330 #14 Oct 18 2023 02:09:59
%S A167330 1,6,10,36,18,60,26,216,100,108,42,360,50,156,180,1296,66,600,74,648,
%T A167330 260,252,90,2160,324,300,1000,936,114,1080,122,7776,420,396,468,3600,
%U A167330 146,444,500,3888,162,1560,170,1512,1800,540,186,12960,676,1944
%N A167330 Totally multiplicative sequence with a(p) = 2*(2p-1) = 4p-2 for prime p.
%H A167330 G. C. Greubel, <a href="/A167330/b167330.txt">Table of n, a(n) for n = 1..1000</a>
%F A167330 Multiplicative with a(p^e) = (2*(2p-1))^e. If n = Product p(k)^e(k) then a(n) = Product (2*(2*p(k)-1))^e(k).
%F A167330 a(n) = A061142(n) * A166651(n) = 2^bigomega(n) * A166651(n) = 2^A001222(n) * A166651(n).
%t A167330 a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((2*fi[[All, 1]] - 1)^fi[[All, 2]])); Table[a[n]*2^PrimeOmega[n], {n, 1, 100}] (* _G. C. Greubel_, Jun 06 2016 *)
%t A167330 f[p_, e_] := (4*p-2)^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Oct 18 2023 *)
%o A167330 (PARI) a(n) = {my(f=factor(n)); for (k=1, #f~, f[k,1] = 4*f[k,1]-2;); factorback(f);} \\ _Michel Marcus_, Jun 06 2016
%Y A167330 Cf. A001222, A061142, A166651.
%K A167330 nonn,easy,mult
%O A167330 1,2
%A A167330 _Jaroslav Krizek_, Nov 01 2009