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 A066940 #16 Dec 10 2024 11:13:43
%S A066940 2,3,5,6,7,10,11,12,13,17,18,20,21,24,25,26,28,29,30,33,35,36,37,41,
%T A066940 42,43,44,45,49,50,52,53,57,58,59,60,61,64,65,66,67,68,69,70,73,74,77,
%U A066940 78,79,81,82,83,84,87,88,89,98,99,100,101,104,105,106,109,110,111,112,113
%N A066940 Numbers k such that gcd(prime(k+1) + 1, prime(k) + 1) = 2.
%C A066940 Numbers k such that A063086(k) = 2. - _Andrew Howroyd_, Dec 10 2024
%H A066940 Harry J. Smith, <a href="/A066940/b066940.txt">Table of n, a(n) for n = 1..1000</a>
%t A066940 Select[ Range[120], GCD[ Prime[ # + 1] + 1, Prime[ # ] + 1] == 2 & ]
%o A066940 (PARI) isok(k) = { gcd(prime(k+1) + 1, prime(k) + 1) == 2 } \\ _Harry J. Smith_, Apr 09 2010
%Y A066940 Cf. A063086, A066941, A066942, A066943, A066944, A067603, A067604.
%K A066940 nonn
%O A066940 1,1
%A A066940 _Benoit Cloitre_, Jan 24 2002
%E A066940 Edited by _Robert G. Wilson v_, Feb 01 2002