login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A267067 Primes p such that mu(p-2) = 1; that is, p-2 is squarefree and has an even number of prime factors, where mu is the Moebius function (A008683). 1

%I #15 Mar 08 2023 07:50:49

%S 3,17,23,37,41,53,59,67,71,79,89,97,113,131,157,163,179,211,223,239,

%T 251,269,293,307,311,331,337,367,373,379,383,397,409,419,439,449,487,

%U 491,499,503,521,547,593,599,613,631,673,683,691,701,709,719,733,739

%N Primes p such that mu(p-2) = 1; that is, p-2 is squarefree and has an even number of prime factors, where mu is the Moebius function (A008683).

%C From _Robert Israel_, Jan 10 2016: (Start)

%C Includes all members of A063638 except 11.

%C The first terms not in A063638 are 3 and 1367. (End)

%H Robert Israel, <a href="/A267067/b267067.txt">Table of n, a(n) for n = 1..10000</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/MoebiusFunction.html">Moebius Function</a>

%p select(p -> isprime(p) and numtheory:-mobius(p-2)=1, [seq(i,i=3..1000,2)]); # _Robert Israel_, Jan 10 2016

%t Select[Prime[Range[200]], MoebiusMu[# - 2] == 1 &]

%o (Magma) [n: n in [3..1000] | IsPrime(n) and MoebiusMu(n-2) eq 1];

%o (PARI) isok(p) = isprime(p) && (p>2) && (moebius(p-2)==1); \\ _Michel Marcus_, Mar 08 2023

%Y Cf. A008683, A063638, A088179.

%K nonn

%O 1,1

%A _Vincenzo Librandi_, Jan 10 2016

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 22:18 EDT 2024. Contains 371782 sequences. (Running on oeis4.)