login
A066896
prime(2n) + prime(n) == 0 (mod n).
2
1, 2, 3, 5, 8, 10, 11, 24, 34, 63, 150, 212, 213, 375, 1245, 2256, 7491, 10128, 10144, 10148, 18700, 25315, 25320, 25333, 401500, 401526, 1019658, 1393220, 1393236, 1393270, 2598060, 2598136, 9095338, 12457665, 17063254, 32038770, 43924379
OFFSET
1,2
MATHEMATICA
Select[Range[44*10^6], Divisible[Prime[#]+Prime[2#], #]&] (* Harvey P. Dale, Aug 02 2018 *)
PROG
(PARI) is(n)=(prime(n)+prime(2*n))%n==0 \\ Charles R Greathouse IV, May 29 2013
(PARI) p=2; q=3; n=1; while(1, if((p+q)%n==0, print1(n", ")); p=nextprime(p+1); q=nextprime(nextprime(q+1)+1); n++) \\ Charles R Greathouse IV, May 29 2013
CROSSREFS
Sequence in context: A099107 A261255 A085833 * A369064 A277625 A098177
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jan 24 2002
EXTENSIONS
a(22)-a(37) from Alex Ratushnyak, May 21 2013
STATUS
approved