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 A067660 #18 Jun 06 2022 05:47:58
%S A067660 2,11,19,43,67,131,163,179,227,347,419,443,491,523,563,571,619,683,
%T A067660 691,739,787,947,1019,1051,1091,1123,1187,1291,1451,1499,1571,1579,
%U A067660 1667,1723,1747,1867,1907,1931,2003,2131,2203,6043,2347,2371,2531,2579,2659
%N A067660 Values of gcd(k!+1,2^k+1) not equal to 1 taking k in increasing order.
%H A067660 Amiram Eldar, <a href="/A067660/b067660.txt">Table of n, a(n) for n = 1..10000</a>
%F A067660 If 2m+1 is prime and is in the sequence, 2m+1 = gcd(m!+1, 2^m+1).
%t A067660 Table[GCD[n!+1,2^n+1],{n,0,4000}]/.(1->Nothing) (* _Harvey P. Dale_, Aug 03 2018 *)
%o A067660 (PARI) for(k=0,3000,d=gcd(k!+1,2^k+1); if(d<>1,print1(d,",")))
%Y A067660 Cf. A068481.
%K A067660 nonn
%O A067660 1,1
%A A067660 _Benoit Cloitre_, Feb 03 2002
%E A067660 Corrected and extended by _Rick L. Shepherd_, May 20 2002
%E A067660 Offset corrected by _Amiram Eldar_, Jun 06 2022