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 A167354 #18 Dec 15 2022 06:18:33
%S A167354 1,0,1,0,9,0,25,0,1,0,81,0,121,0,9,0,225,0,289,0,25,0,441,0,81,0,1,0,
%T A167354 729,0,841,0,81,0,225,0,1225,0,121,0,1521,0,1681,0,9,0,2025,0,625,0
%N A167354 Totally multiplicative sequence with a(p) = (p-2)^2 = p^2-4p+4 for prime p.
%H A167354 G. C. Greubel, <a href="/A167354/b167354.txt">Table of n, a(n) for n = 1..1000</a>
%F A167354 Multiplicative with a(p^e) = ((p-2)^2)^e. If n = Product p(k)^e(k) then a(n) = Product ((p(k)-2)^2)^e(k).
%F A167354 a(2k) = 0 for k >= 1.
%F A167354 a(n) = A166586(n)^2.
%F A167354 Sum_{k=1..n} a(k) ~ c * n^3, where c = 1 / (3 * Product_{p prime} (1 + 4/p^2)) = 0.08140990308... . - _Amiram Eldar_, Dec 15 2022
%t A167354 a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 2)^fi[[All, 2]])); Table[a[n]^2, {n, 1, 100}] (* _G. C. Greubel_, Jun 11 2016 *)
%Y A167354 Cf. A166586.
%K A167354 nonn,mult
%O A167354 1,5
%A A167354 _Jaroslav Krizek_, Nov 01 2009