This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A336376 #4 Oct 18 2020 22:36:25 %S A336376 2,5,11,17,31,41,47,59,67,83,103,109,127,149,157,167,179,191,211,227, %T A336376 241,257,277,283,307,313,331,347,353,367,389,401,419,431,439,449,461, %U A336376 467,487,499,509,523,547,563,587,599,617,631,653,661,709,727,739,761 %N A336376 Primes p(n) such that gcd(n, prime(n)+prime(n+2)) = 1. %C A336376 This sequence and A336377 partition the set of primes. %e A336376 In the following table, p(n) = A000040(n) = prime(n). %e A336376 n p(n) p(n)+p(n+2) gcd %e A336376 1 2 7 1 %e A336376 2 3 10 2 %e A336376 3 5 16 1 %e A336376 4 7 20 4 %e A336376 5 11 28 1 %e A336376 6 13 32 2 %e A336376 1 and 3 are in A336374; 2 and 4 are in A336375; 2 and 5 are in A336376; 3 and 7 are in A336377. %t A336376 p[n_] := Prime[n]; %t A336376 u = Select[Range[200], GCD[#, p[#] + p[# + 2]] == 1 &] (* A336374 *) %t A336376 v = Select[Range[200], GCD[#, p[#] + p[# + 2]] > 1 &] (* A336375 *) %t A336376 Prime[u] (* A336376 *) %t A336376 Prime[v] (* A336377 *) %Y A336376 Cf. A000040, A336366, A336374, A336375, A336377. %K A336376 nonn %O A336376 1,1 %A A336376 _Clark Kimberling_, Oct 06 2020