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 A142064 #16 Sep 08 2022 08:45:35
%S A142064 59,191,257,389,521,587,653,719,983,1049,1181,1511,1709,1907,1973,
%T A142064 2039,2237,2633,2699,2897,2963,3359,3491,3557,3623,3821,4019,4217,
%U A142064 4283,4349,4481,4547,4679,4877,4943,5009,5273,5471,5669,5801,5867,6131,6197,6263
%N A142064 Primes congruent to 26 mod 33.
%H A142064 Vincenzo Librandi, <a href="/A142064/b142064.txt">Table of n, a(n) for n = 1..1000</a>
%F A142064 a(n) ~ 20n log n. - _Charles R Greathouse IV_, Jul 02 2016
%t A142064 Select[Range[26, 20000, 33], PrimeQ] (* _Vladimir Joseph Stephan Orlovsky_, Jun 24 2011 *)
%t A142064 Select[Prime[Range[1000]],MemberQ[{26},Mod[#,33]]&] (* _Vincenzo Librandi_, Aug 18 2012 *)
%o A142064 (Magma) [p: p in PrimesUpTo(8000) | p mod 33 eq 26 ]; // _Vincenzo Librandi_, Aug 18 2012
%o A142064 (PARI) is(n)=isprime(n) && n%33==26 \\ _Charles R Greathouse IV_, Jul 02 2016
%Y A142064 Cf. A000040.
%K A142064 nonn,easy
%O A142064 1,1
%A A142064 _N. J. A. Sloane_, Jul 11 2008