|
|
A336374
|
|
Numbers k such that gcd(k, prime(k) + prime(k+2)) = 1.
|
|
4
|
|
|
1, 3, 5, 7, 11, 13, 15, 17, 19, 23, 27, 29, 31, 35, 37, 39, 41, 43, 47, 49, 53, 55, 59, 61, 63, 65, 67, 69, 71, 73, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 107, 109, 113, 115, 119, 121, 127, 129, 131, 135, 137, 139, 141, 143, 147, 149, 151
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
This sequence and A336374 partition the positive integers.
|
|
LINKS
|
|
|
EXAMPLE
|
In the following table, p(k) = A000040(k) = prime(k).
k p(k) p(k)+p(k+2) gcd
1 2 7 1
2 3 10 2
3 5 16 1
4 7 20 4
5 11 28 1
6 13 32 2
|
|
MATHEMATICA
|
p[n_] := Prime[n];
u = Select[Range[200], GCD[#, p[#] + p[# + 2]] == 1 &] (* A336374 *)
v = Select[Range[200], GCD[#, p[#] + p[# + 2]] > 1 &] (* A336375 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|