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 A133410 #37 Apr 07 2025 17:03:42
%S A133410 2,11,17,23,29,37,41,47,53,59,67,71,79,83,89,97,101,107,113,127,127,
%T A133410 131,137,149,149,157,163,167,173,179,191,191,197,211,211,223,223,227,
%U A133410 233,239,251,251,257,263,269,277,281,293,293,307,307,311,317,331,331,337
%N A133410 Least prime p such that p-6*n is prime.
%C A133410 If duplicates are omitted, this is the sequence of primes p such that all p - phi(k) - 1 are composite for 1 <= phi(k)-1 < p. - _Michel Lagneau_, Sep 14 2012
%C A133410 If duplicates are omitted, the given entries equal A025584 (p: p-2 is not a prime) except A025584 includes 3 (since 1 is not prime). - _Harry G. Coin_, Nov 29 2015
%H A133410 Robert Israel, <a href="/A133410/b133410.txt">Table of n, a(n) for n = 0..10000</a>
%p A133410 Primes:= select(isprime,{2,seq(i,i=3..10^4,2)}):
%p A133410 seq(min(Primes intersect map(`+`,Primes,6*n)),n=0..1000); # _Robert Israel_, Nov 30 2015
%t A133410 a={};Do[i=6*n+1; While[Not[PrimeQ[i]&&PrimeQ[i-6*n]],i++ ];AppendTo[a,i],{n,0,60}]; a (* _Stefan Steinerberger_, Nov 26 2007 *)
%t A133410 Table[Module[{p=NextPrime[6n]},While[!PrimeQ[p-6n],p=NextPrime[p]];p],{n,0,60}] (* _Harvey P. Dale_, Apr 07 2025 *)
%o A133410 (PARI) a(n) = {k=1; while(k, if(ispseudoprime(prime(k)-6*n), return(prime(k))); k++)} \\ _Altug Alkan_, Dec 04 2015
%Y A133410 Cf. A025584, A067829 (complement w.r.t. primes), A133387.
%K A133410 nonn
%O A133410 0,1
%A A133410 _Pierre CAMI_, Nov 25 2007
%E A133410 More terms from _Stefan Steinerberger_, Nov 26 2007