A166586 - OEIS

%I #42 Feb 10 2023 12:54:52

%S 1,0,1,0,3,0,5,0,1,0,9,0,11,0,3,0,15,0,17,0,5,0,21,0,9,0,1,0,27,0,29,

%T 0,9,0,15,0,35,0,11,0,39,0,41,0,3,0,45,0,25,0,15,0,51,0,27,0,17,0,57,

%U 0,59,0,5,0,33,0,65,0,21,0,69,0,71,0,9,0

%N Totally multiplicative sequence with a(p) = p - 2 for prime p.

%H G. C. Greubel, <a href="/A166586/b166586.txt">Table of n, a(n) for n = 1..1000</a>

%F Multiplicative with a(p^e) = (p-2)^e. If n = Product p(k)^e(k) then a(n) = Product (p(k) - 2)^e(k). a(2k) = 0 for k >= 1.

%F a(A000244(n)) = 1. - _Michel Marcus_, Dec 13 2014

%F Dirichlet g.f.: 1 / Product_{p prime} (1 - p^(1 - s) + 2*p^(-s)). The Dirichlet inverse is multiplicative with b(p) = 2 - p, b(p^e) = 0, for e > 1. - _Álvar Ibeas_, Nov 24 2017 [corrected by _Vaclav Kotesovec_, Feb 10 2023]

%F Sum_{k=1..n} a(k) ~ c * n^2/2, where c = Product_{primes} (1 - 1/(1 + p*(p-1)/2)) = 0.3049173579282080265466051390930446635010608835584906520231313997... - _Vaclav Kotesovec_, Feb 10 2023

%p f:= proc(n) local t;

%p     mul((t[1]-2)^t[2],t=ifactors(n)[2])

%p end proc:

%p map(f, [$1..100]); # _Robert Israel_, Jun 07 2016

%t a[1] = 1; a[n_] := (fi = FactorInteger[n]; Times @@ ((fi[[All, 1]] - 2)^fi[[All, 2]])); Table[a[n], {n, 1, 50}] (* _G. C. Greubel_, Jun 06 2016 *)

%o (PARI) a(n) = my(f = factor(n)); for (i=1, #f~, f[i,1] -= 2); factorback(f); \\ _Michel Marcus_, Dec 13 2014

%o (PARI) for(n=1, 100, print1(direuler(p=2, n, 1/(1-p*X+2*X))[n], ", ")) \\ _Vaclav Kotesovec_, Feb 10 2023

%Y Cf. A000244 (powers of 3).

%K nonn,mult

%O 1,5

%A _Jaroslav Krizek_, Oct 17 2009

%E More terms from _Alonso del Arte_, Dec 10 2014

%E a(69) and a(75) corrected by _G. C. Greubel_, Jun 06 2016

%E Erroneous formula and program removed by _G. C. Greubel_, Jun 06 2016