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 A167296 #13 Oct 18 2023 02:09:38
%S A167296 1,0,4,0,12,0,20,0,16,0,36,0,44,0,48,0,60,0,68,0,80,0,84,0,144,0,64,0,
%T A167296 108,0,116,0,144,0,240,0,140,0,176,0,156,0,164,0,192,0,180,0,400,0,
%U A167296 240,0,204,0,432,0,272,0,228,0,236,0,320,0,528,0,260,0,336
%N A167296 Totally multiplicative sequence with a(p) = 4*(p-2) for prime p.
%H A167296 G. C. Greubel, <a href="/A167296/b167296.txt">Table of n, a(n) for n = 1..1000</a>
%F A167296 Multiplicative with a(p^e) = (4*(p-2))^e. If n = Product p(k)^e(k) then a(n) = Product (4*(p(k)-2))^e(k).
%F A167296 a(2k) = 0 for k >= 1.
%F A167296 a(n) = A165825(n) * A166586(n) = 4^bigomega(n) * A166586(n) = 4^A001222(n) * A166586(n).
%t A167296 a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 2)^fi[[All, 2]])); Table[a[n]*4^PrimeOmega[n], {n, 1, 100}] (* _G. C. Greubel_, Jun 06 2016 *)
%t A167296 f[p_, e_] := (4*(p-2))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Oct 18 2023 *)
%Y A167296 Cf. A001222, A165825, A166586.
%K A167296 nonn,easy,mult
%O A167296 1,3
%A A167296 _Jaroslav Krizek_, Nov 01 2009