login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A167295
Totally multiplicative sequence with a(p) = 3*(p-2) for prime p.
1
1, 0, 3, 0, 9, 0, 15, 0, 9, 0, 27, 0, 33, 0, 27, 0, 45, 0, 51, 0, 45, 0, 63, 0, 81, 0, 27, 0, 81, 0, 87, 0, 81, 0, 135, 0, 105, 0, 99, 0, 117, 0, 123, 0, 81, 0, 135, 0, 225, 0, 135, 0, 153, 0, 243, 0, 153, 0, 171, 0, 177, 0, 135, 0, 297, 0, 195, 0, 189, 0, 207
OFFSET
1,3
LINKS
FORMULA
Multiplicative with a(p^e) = (3*(p-2))^e. If n = Product p(k)^e(k) then a(n) = Product (3*(p(k)-2))^e(k).
a(2k) = 0 for k >= 1.
a(n) = A165824(n) * A166586(n) = 3^bigomega(n) * A166586(n) = 3^A001222(n) * A166586(n).
MATHEMATICA
a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 2)^fi[[All, 2]])); Table[a[n]*3^PrimeOmega[n], {n, 1, 100}](* G. C. Greubel, Jun 05 2016 *)
f[p_, e_] := (3*(p-2))^e; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 19 2023 *)
CROSSREFS
KEYWORD
nonn,easy,mult
AUTHOR
Jaroslav Krizek, Nov 01 2009
STATUS
approved