Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Jul 24 2023 10:04:55
%S 157,281,467,653,839,1087,1459,1583,1831,2017,2141,2203,2389,2699,
%T 3257,3319,3691,3877,4001,4373,4621,4931,4993,5179,5303,5737,5861,
%U 5923,6047,6481,6791,6977,7039,7349,7411,7907,8093,8527,8713,8837,9209,9643,9767
%N Primes congruent to 33 mod 62.
%H Vincenzo Librandi, <a href="/A142874/b142874.txt">Table of n, a(n) for n = 1..1000</a>
%F a(n) ~ 30n log n. - _Charles R Greathouse IV_, Jul 03 2016
%t Select[Prime[Range[2500]], MemberQ[{33}, Mod[#, 62]] &] (* _Vincenzo Librandi_, Sep 06 2012 *)
%t Select[Range[33,10000,62],PrimeQ] (* _Harvey P. Dale_, May 03 2013 *)
%o (Magma) [p: p in PrimesUpTo(10000) | p mod 62 eq 33 ] ; // _Vincenzo Librandi_, Sep 06 2012
%o (PARI) is(n)=isprime(n) && n%62==33 \\ _Charles R Greathouse IV_, Jul 03 2016
%Y Cf. A000040, A142006.
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_, Jul 11 2008