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”).
%I #24 Jan 14 2024 14:19:37
%S 1,2,4,6,18,42,44,49,246,257,259,272,283,294,25284,62648,62664,62673,
%T 62700,62701,158706,404835,404859,405119,405448,405451,2630908,
%U 2630929,2631249,2631303,2631368,2631414,2631509,2631517,2631576,2631666,17405852,44932936
%N Numbers k such that prime(2*k) - prime(k) == 0 (mod k).
%e prime(2*2) - prime(2) = 7 - 3 = 4 that is equal to 0 mod 2, so 2 is in the sequence.
%o (PARI) isok(n) = (prime(2*n)-prime(n)) % n == 0; \\ _Michel Marcus_, Nov 20 2013
%Y Cf. A072473.
%K nonn
%O 1,2
%A _Benoit Cloitre_, Jan 24 2002
%E a(15)-a(20) from _Michel Marcus_, Nov 20 2013
%E a(21)-a(38) from _Donovan Johnson_, Nov 20 2013