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 A142068 #16 Apr 30 2025 09:16:57
%S A142068 131,197,263,461,593,659,857,1187,1319,1451,1583,1847,1913,1979,2111,
%T A142068 2243,2309,2441,2837,2903,2969,3167,3299,3761,4091,4157,4289,4421,
%U A142068 4751,4817,5081,5147,5279,5477,5741,5807,5939,6203,6269,6599,6863,7127,7193,7457
%N A142068 Primes congruent to 32 mod 33.
%C A142068 Primes congruent to 65 mod 66. - _Chai Wah Wu_, Apr 29 2025
%H A142068 Vincenzo Librandi, <a href="/A142068/b142068.txt">Table of n, a(n) for n = 1..1000</a>
%F A142068 a(n) ~ 20n log n. - _Charles R Greathouse IV_, Jul 02 2016
%t A142068 Select[Range[32, 20000, 33], PrimeQ] (* _Vladimir Joseph Stephan Orlovsky_, Jun 24 2011 *)
%t A142068 Select[Prime[Range[3000]],MemberQ[{32},Mod[#,33]]&] (* _Vincenzo Librandi_, Aug 18 2012 *)
%o A142068 (Magma) [p: p in PrimesUpTo(8000) | p mod 33 eq 32 ]; // _Vincenzo Librandi_, Aug 18 2012
%o A142068 (PARI) is(n)=isprime(n) && n%33==32 \\ _Charles R Greathouse IV_, Jul 02 2016
%Y A142068 Cf. A000040, A142067.
%K A142068 nonn,easy
%O A142068 1,1
%A A142068 _N. J. A. Sloane_, Jul 11 2008