|
|
A066940
|
|
Numbers n such that gcd(prime(n+1) + 1, prime(n) + 1) = 2.
|
|
9
|
|
|
2, 3, 5, 6, 7, 10, 11, 12, 13, 17, 18, 20, 21, 24, 25, 26, 28, 29, 30, 33, 35, 36, 37, 41, 42, 43, 44, 45, 49, 50, 52, 53, 57, 58, 59, 60, 61, 64, 65, 66, 67, 68, 69, 70, 73, 74, 77, 78, 79, 81, 82, 83, 84, 87, 88, 89, 98, 99, 100, 101, 104, 105, 106, 109, 110, 111, 112, 113
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[ Range[120], GCD[ Prime[ # + 1] + 1, Prime[ # ] + 1] == 2 & ]
|
|
PROG
|
(PARI) { n=0; for (m=1, 10^10, if (gcd(prime(m+1) + 1, prime(m) + 1) == 2, write("b066940.txt", n++, " ", m); if (n==1000, return)) ) } \\ Harry J. Smith, Apr 09 2010
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|