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 A121764 #48 Sep 08 2022 08:45:27
%S A121764 37,67,79,97,127,157,163,211,223,277,307,331,337,367,373,379,397,409,
%T A121764 439,457,487,499,541,547,577,607,613,631,673,691,709,727,733,739,751,
%U A121764 757,769,787,853,877,907,919,937,967,991,997,1009,1039,1069,1087,1117
%N A121764 Single (or isolated or non-twin) primes of form 6n + 1.
%C A121764 For the first 30000 terms a(n) > A121762(n), see plot A121764(n) - A121762(n). But is it so for all n? - _Zak Seidov_, Apr 25 2015
%C A121764 Subsequence of A002476. - _Michel Marcus_, Apr 26 2015
%H A121764 Zak Seidov, <a href="/A121764/b121764.txt">Table of n, a(n) for n = 1..10000</a>
%H A121764 Zak Seidov, <a href="/A121764/a121764.jpg">Plot of A121764(n) - A121762(n)</a>
%t A121764 Select[Table[6n + 1, {n, 200}], PrimeQ[#] && !PrimeQ[#-2] &] (* _Ray Chandler_, Aug 22 2006 *)
%t A121764 Select[Prime[Range[200]],Mod[#,6]==1&&NoneTrue[#+{2,-2},PrimeQ]&] (* _Harvey P. Dale_, Jul 16 2021 *)
%o A121764 (PARI) {is(n)=n%6==1 && isprime(n) && !isprime(n-2)}; \\ _G. C. Greubel_, Feb 26 2019
%o A121764 (Magma) [n: n in [1..1150] | (n mod 6 eq 1) and not IsPrime(n-2) and IsPrime(n)]; // _G. C. Greubel_, Feb 26 2019
%o A121764 (Sage) [n for n in (1..1150) if mod(n,6)==1 and not is_prime(n-2) and is_prime(n)] # _G. C. Greubel_, Feb 26 2019
%Y A121764 Cf. A007510, A121765, A002476, A121762, A038179, A007310, A038511.
%K A121764 nonn
%O A121764 1,1
%A A121764 _Lekraj Beedassy_, Aug 20 2006
%E A121764 Extended by _Ray Chandler_, Aug 22 2006