A140841 -id:A140841 - cp's OEIS frontend

A075745 Numbers n such that 210*n + 13 is prime.

0, 1, 2, 3, 4, 5, 7, 8, 10, 14, 15, 16, 17, 18, 19, 21, 27, 32, 36, 38, 41, 43, 45, 47, 48, 49, 50, 51, 54, 60, 61, 62, 66, 67, 68, 69, 70, 71, 76, 77, 79, 83, 85, 88, 90, 92, 93, 94, 95, 96, 98, 100, 102, 105, 106, 107, 113, 116, 118, 121, 122, 124, 125, 127, 128, 129, 132

Offset: 1

Zak Seidov, Oct 08 2002

			n=2: 210*2 + 13 = 433 is prime.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Cf. A140841.

[n: n in [0..150]| IsPrime(210*n + 13)]; // Vincenzo Librandi, Oct 04 2012

Select[Range[0, 500], PrimeQ[210*# + 13] &] (* Vincenzo Librandi, Oct 04 2012 *)

is(n)=isprime(210*n+13) \\ Charles R Greathouse IV, May 22 2017

0 inserted by Ray Chandler, Apr 30 2010

A140536 Primes congruent to 13 or 197 mod 210.

Original entry on oeis.org

13, 197, 223, 433, 617, 643, 827, 853, 1063, 1483, 1667, 1693, 1877, 2087, 2113, 2297, 2927, 2953, 3137, 3163, 3347, 3373, 3557, 3583, 3767, 3793, 4003, 4397, 4423, 4817, 5237, 5657, 5683, 5867, 6287, 6733, 6917, 7127, 7547, 7573, 7757, 7993, 8387, 8597

Offset: 1

Juri-Stepan Gerasimov, Jul 28 2008

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Cf. A140841. - R. J. Mathar, Oct 22 2009

Cf. A000040.

[p: p in PrimesUpTo(9000)|p mod 210 in {13,197}] // Vincenzo Librandi, Dec 18 2010

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

Select[Prime[Range[1100]],MemberQ[{13,197},Mod[#,210]]&] (* Harvey P. Dale, May 03 2011 *)

cp's OEIS Frontend

A075745 Numbers n such that 210*n + 13 is prime.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Extensions