login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Primes prime(m) such that G = prime(m-1)# - prime(m) is prime.
0

%I #11 Aug 24 2019 14:13:13

%S 7,11,13,17,23,83,89,97,151,373,433,857,4013,8821,12959

%N Primes prime(m) such that G = prime(m-1)# - prime(m) is prime.

%C G = prime(n-1)# - prime(n) where G is a prime is a special case of A090188 where (k=1).

%e 7 is a term because 23 = 2*3*5 - 7 is prime.

%o (PARI) primo(p) = my(ip=primepi(p)); factorback(primes(ip)); \\ A002110

%o isok(p) = isprime(p) && isprime(primo(precprime(p-1)) - p);

%Y Cf. A002110, A065314, A060882, A096649, A090188, A065316.

%K nonn,more

%O 1,1

%A _Mohamed Sami Gattoufi_, Aug 11 2019