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!)
 A339180 Primes p such that p mod A001414(p-1) = p mod A001414(p+1). 3

%I

%S 11,17,31,151,241,251,577,727,991,1429,1567,1597,1741,2243,2887,3001,

%T 3041,3571,3739,4003,4049,4129,4271,4513,4801,5407,6673,6733,6833,

%U 7873,8951,9539,9631,10487,10639,11789,12097,14627,14629,14947,16561,16927,18617,18749,18797,19081,19457,20551,21121

%N Primes p such that p mod A001414(p-1) = p mod A001414(p+1).

%H Robert Israel, <a href="/A339180/b339180.txt">Table of n, a(n) for n = 1..5000</a>

%e a(4) = 151 is in the sequence because 151 is prime, A001414(150)=2+3+5+5=15, A001414(152)=2+2+2+19=25, and 151 mod 15 = 151 mod 25 = 1.

%p spf:= n -> add(t[1]*t[2],t=ifactors(n)[2]):

%p select(p -> isprime(p) and p mod spf(p-1) = p mod spf(p+1), [seq(i,i=3..100000,2)]);

%Y Includes A086711, A339181 and A339182.

%Y Cf. A001414.

%K nonn

%O 1,1

%A _J. M. Bergot_ and _Robert Israel_, Nov 26 2020

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 June 22 01:06 EDT 2021. Contains 345367 sequences. (Running on oeis4.)