cp's OEIS Frontend

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.

A142067 Primes congruent to 31 mod 33.

This page as a plain text file.
%I A142067 #12 Sep 08 2022 08:45:35
%S A142067 31,97,163,229,691,757,823,1021,1087,1153,1483,1549,1747,1879,2011,
%T A142067 2143,2341,2473,2539,2671,2803,3001,3067,3331,3463,3529,3727,3793,
%U A142067 4057,4519,4651,4783,5113,5179,5443,5641,5839,6037,6301,6367,6763,6829,6961,7027
%N A142067 Primes congruent to 31 mod 33.
%H A142067 Vincenzo Librandi, <a href="/A142067/b142067.txt">Table of n, a(n) for n = 1..1000</a>
%F A142067 a(n) ~ 20n log n. - _Charles R Greathouse IV_, Jul 02 2016
%t A142067 Select[Range[31, 20000, 33], PrimeQ] (* _Vladimir Joseph Stephan Orlovsky_, Jun 24 2011 *)
%t A142067 Select[Prime[Range[3000]],MemberQ[{31},Mod[#,33]]&] (* _Vincenzo Librandi_, Aug 18 2012 *)
%o A142067 (Magma) [p: p in PrimesUpTo(8000) | p mod 33 eq 31 ]; // _Vincenzo Librandi_, Aug 18 2012
%o A142067 (PARI) is(n)=isprime(n) && n%33==31 \\ _Charles R Greathouse IV_, Jul 02 2016
%Y A142067 Cf. A000040.
%K A142067 nonn,easy
%O A142067 1,1
%A A142067 _N. J. A. Sloane_, Jul 11 2008