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 A167302 #13 Oct 19 2023 02:15:57
%S A167302 1,0,10,0,30,0,50,0,100,0,90,0,110,0,300,0,150,0,170,0,500,0,210,0,
%T A167302 900,0,1000,0,270,0,290,0,900,0,1500,0,350,0,1100,0,390,0,410,0,3000,
%U A167302 0,450,0,2500,0,1500,0,510,0,2700,0,1700,0,570,0,590,0,5000,0,3300
%N A167302 Totally multiplicative sequence with a(p) = 10*(p-2) for prime p.
%H A167302 G. C. Greubel, <a href="/A167302/b167302.txt">Table of n, a(n) for n = 1..1000</a>
%F A167302 Multiplicative with a(p^e) = (10*(p-2))^e. If n = Product p(k)^e(k) then a(n) = Product (10*(p(k)-2))^e(k).
%F A167302 a(2k) = 0 for k >= 1.
%F A167302 a(n) = A165831(n) * A166586(n) = 10^bigomega(n) * A166586(n) = 10^A001222(n) * A166586(n).
%t A167302 a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 2)^fi[[All, 2]])); Table[a[n]*10^PrimeOmega[n], {n, 1, 100}] (* _G. C. Greubel_, Jun 07 2016 *)
%t A167302 f[p_, e_] := (10*(p-2))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, Oct 19 2023 *)
%Y A167302 Cf. A001222, A165831, A166586.
%K A167302 nonn,easy,mult
%O A167302 1,3
%A A167302 _Jaroslav Krizek_, Nov 01 2009