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 #19 Jan 24 2023 06:56:33
%S 13,197,223,433,617,643,827,853,1063,1483,1667,1693,1877,2087,2113,
%T 2297,2927,2953,3137,3163,3347,3373,3557,3583,3767,3793,4003,4397,
%U 4423,4817,5237,5657,5683,5867,6287,6733,6917,7127,7547,7573,7757,7993,8387,8597
%N Primes congruent to 13 or 197 mod 210.
%H Vincenzo Librandi, <a href="/A140536/b140536.txt">Table of n, a(n) for n = 1..1000</a>
%p A140536 := proc(n) local a; if n = 1 then 13; else a := nextprime(procname(n-1)) ; while not a mod 210 in {13,197} do a := nextprime(a) ; end do: return a; end if; end: seq(A140536(n),n=1..80) ; # _R. J. Mathar_, Oct 22 2009
%t Select[Prime[Range[1100]],MemberQ[{13,197},Mod[#,210]]&] (* _Harvey P. Dale_, May 03 2011 *)
%o (Magma)[p: p in PrimesUpTo(9000)|p mod 210 in {13,197}] // _Vincenzo Librandi_, Dec 18 2010
%Y Cf. A140841. - _R. J. Mathar_, Oct 22 2009
%Y Cf. A000040.
%K nonn,easy
%O 1,1
%A _Juri-Stepan Gerasimov_, Jul 28 2008