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 A167357 #17 Dec 15 2022 06:14:23
%S A167357 1,0,6,0,24,0,50,0,36,0,126,0,176,0,144,0,300,0,374,0,300,0,546,0,576,
%T A167357 0,216,0,864,0,986,0,756,0,1200,0,1400,0,1056,0,1716,0,1886,0,864,0,
%U A167357 2250,0,2500,0,1800,0,2856,0,3024,0,2244,0,3534,0,3776,0,1800
%N A167357 Totally multiplicative sequence with a(p) = (p-2)*(p+3) = p^2+p-6 for prime p.
%H A167357 G. C. Greubel, <a href="/A167357/b167357.txt">Table of n, a(n) for n = 1..1000</a>
%F A167357 Multiplicative with a(p^e) = ((p-2)*(p+3))^e. If n = Product p(k)^e(k) then a(n) = Product ((p(k)-2)*(p(k)+3))^e(k).
%F A167357 a(2k) = 0 for k >= 1.
%F A167357 a(n) = A166586(n) * A166591(n).
%F A167357 Sum_{k=1..n} a(k) ~ c * n^3, where c = (2/Pi^2) / Product_{p prime} (1 - 2/p^2 + 5/p^3 + 6/p^4) = 0.1449357432... . - _Amiram Eldar_, Dec 15 2022
%t A167357 a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 2)^fi[[All, 2]])); b[1] = 1; b[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] + 3)^fi[[All, 2]])); Table[a[n]*b[n], {n, 1, 100}] (* _G. C. Greubel_, Jun 11 2016 *)
%Y A167357 Cf. A166586, A166591.
%K A167357 nonn,mult
%O A167357 1,3
%A A167357 _Jaroslav Krizek_, Nov 01 2009