login

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”).

A142827
Primes congruent to 29 mod 61.
2
29, 151, 761, 883, 1249, 1493, 2347, 2591, 2713, 2957, 3079, 3323, 4177, 4421, 4787, 4909, 5153, 5519, 5641, 6007, 6373, 6983, 7349, 8081, 8447, 10399, 11131, 11497, 11863, 12107, 12473, 13327, 13693, 14303, 14669, 15401, 15767, 15889, 16987, 17231, 17597
OFFSET
1,1
LINKS
FORMULA
a(n) ~ 60n log n. - Charles R Greathouse IV, Jul 03 2016
MATHEMATICA
Select[Prime[Range[2100]], Mod[#, 61]==29&] (* Harvey P. Dale, Mar 30 2011 *)
Select[Range[29, 18000, 61], PrimeQ] (* Harvey P. Dale, Nov 19 2011 *) (* For a larger range of numbers, the second program is faster *)
Select[Prime[Range[2300]], MemberQ[{29}, Mod[#, 61]] &] (* Vincenzo Librandi, Sep 05 2012 *)
PROG
(Magma) [p: p in PrimesUpTo(18000) | p mod 61 eq 29 ] ; // Vincenzo Librandi, Sep 05 2012
(PARI) is(n)=isprime(n) && n%61==29 \\ Charles R Greathouse IV, Jul 03 2016
CROSSREFS
Sequence in context: A103565 A098117 A101096 * A142938 A264252 A264530
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jul 11 2008
STATUS
approved