The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A167345 Totally multiplicative sequence with a(p) = (p-1)*(p-2) = p^2-3p+2 for prime p. 1

%I

%S 1,0,2,0,12,0,30,0,4,0,90,0,132,0,24,0,240,0,306,0,60,0,462,0,144,0,8,

%T 0,756,0,870,0,180,0,360,0,1260,0,264,0,1560,0,1722,0,48,0,2070,0,900,

%U 0

%N Totally multiplicative sequence with a(p) = (p-1)*(p-2) = p^2-3p+2 for prime p.

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

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

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

%K nonn,mult

%O 1,3

%A _Jaroslav Krizek_, Nov 01 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 22 07:26 EDT 2021. Contains 343163 sequences. (Running on oeis4.)