cp's OEIS Frontend

A339182 Primes p such that q = p mod A001414(p-1) = p mod A001414(p+1) is prime.

%I A339182 #8 Nov 30 2020 01:05:20
%S A339182 251,991,1429,1567,1597,1741,2243,3739,4003,4049,4129,4271,4513,5407,
%T A339182 6673,6733,9539,9631,10639,14627,14947,16561,18617,18749,18797,19081,
%U A339182 20551,24851,28729,31151,37571,42641,49529,50047,54751,56897,59513,65563,73751,75683,77743,89783,91807,96799,104537
%N A339182 Primes p such that q = p mod A001414(p-1) = p mod A001414(p+1) is prime.
%C A339182 Members p of A339180 such that p mod A001414(p-1) is prime.
%H A339182 Robert Israel, <a href="/A339182/b339182.txt">Table of n, a(n) for n = 1..2300</a>
%e A339182 a(4) = 1567 is in the sequence because 1567 is prime, A001414(1566) = 2+3+3+3+29 = 40, A001414(1568) = 2+2+2+2+2+7+7=24, 1567 mod 40 = 1567 mod 24 = 7 is prime.
%p A339182 spf:= n -> add(t[1]*t[2], t=ifactors(n)[2]):
%p A339182 filter:= proc(p) local v;
%p A339182 if not isprime(p) then return false fi;
%p A339182 v:= p mod spf(p-1);
%p A339182 isprime(v) and p mod spf(p+1) = v
%p A339182 end proc:
%p A339182 select(filter, [seq(i, i=3..10^5, 2)]);
%Y A339182 Cf. A001414, A339180.
%K A339182 nonn
%O A339182 1,1
%A A339182 _J. M. Bergot_ and _Robert Israel_, Nov 26 2020