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

 


Numbers n such that exactly one of n+-1, n+-2 and n+-3 is prime.
1

%I #20 Mar 09 2022 09:27:43

%S -1,7,11,13,17,19,24,25,27,29,31,33,35,36,41,43,48,49,51,52,54,55,57,

%T 59,61,63,65,66,71,73,75,77,78,84,85,87,88,90,91,92,94,95,96,101,103,

%U 107,109,114,115,116,124,125,126,132,133,135,137,139,141,142,146,147,149

%N Numbers n such that exactly one of n+-1, n+-2 and n+-3 is prime.

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

%F a(n) ~ 6n/log n. -_Charles R Greathouse IV_, May 25 2011

%e a(1)=-1 (-4,-3,-2,0 and 1 are nonprimes, 2 is prime);

%e a(2)=7 (4,6,8,9 and 10 are nonprimes, 5 is prime);

%e a(3)=13 (8,9,10,12 and 14 are nonprimes, 11 is prime).

%t f[n_] := Length[Select[Drop[Range[n - 3, n + 3], {4}], PrimeQ]] == 1; Join[{-1}, Select[Range[0, 200], f]] (* _G. C. Greubel_, Jul 09 2016 *)

%t Join[{-1},Select[Range[200],Total[Boole[PrimeQ[Drop[Range[#-3,#+3],{4}]]]]==1&]] (* _Harvey P. Dale_, Oct 16 2018 *)

%o (PARI) is(n)=isprime(n-3) + isprime(n-2) + isprime(n-1) + isprime(n+1) + isprime(n+2) + isprime(n+3) == 1 \\ _Charles R Greathouse IV_, Jun 13 2017

%Y Cf. A000040, A100317, A141468.

%K sign

%O 1,2

%A _Juri-Stepan Gerasimov_, Nov 18 2009

%E Corrected (11, 57 inserted, 16 replaced by 126) by _R. J. Mathar_, Jun 04 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 19 21:42 EDT 2024. Contains 376014 sequences. (Running on oeis4.)