login
Primes prime(k) such that prime(k) mod k is prime.
2

%I #28 Sep 06 2024 11:47:45

%S 5,7,17,19,23,41,47,53,61,71,79,89,101,107,113,127,131,137,139,151,

%T 163,167,173,181,191,193,197,211,223,227,229,233,239,241,257,269,277,

%U 281,313,317,347,359,367,373,383,397,421,433,443,457,463,479,503,521,541

%N Primes prime(k) such that prime(k) mod k is prime.

%H Amiram Eldar, <a href="/A363752/b363752.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = A000040(A363751(n)).

%e The 9th prime is 23 and 23 mod 9 = 5, which is prime, so 23 is a term.

%t Table[If[PrimeQ[Mod[Prime[k], k]], Prime[k], Nothing], {k, 1, 100}]

%o (Python)

%o from sympy import prime, isprime

%o a363752=[]

%o for k in range(1, 101):

%o if isprime(prime(k)%k):

%o a363752.append(prime(k))

%Y Cf. A000040, A004648, A363751.

%K nonn

%O 1,1

%A _Nicholas Leonard_, Jun 19 2023