A142199 -id:A142199 - cp's OEIS frontend

A142212 Primes congruent to 15 mod 41.

97, 179, 1163, 1327, 1409, 1901, 2311, 2393, 2557, 2803, 3049, 3541, 3623, 5099, 5591, 6247, 6329, 7477, 7559, 7723, 8297, 8461, 8543, 8707, 9199, 9281, 10429, 11003, 11987, 12479, 12889, 13217, 13381, 13463, 13627, 13709, 13873, 14447, 14939, 15349, 15923

Offset: 1

N. J. A. Sloane, Jul 11 2008

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

Cf. A000040, A059236, A142199, A142200, A142211.

[p: p in PrimesUpTo(16000) | p mod 41 eq 15 ]; // Vincenzo Librandi, Aug 23 2012

Select[Range[15,30000,41],PrimeQ] (* Vladimir Joseph Stephan Orlovsky, May 17 2011 *)
Select[Prime[Range[5000]],MemberQ[{15},Mod[#,41]]&] (* Vincenzo Librandi, Aug 23 2012 *)

is(n)=isprime(n) && n%41==15 \\ Charles R Greathouse IV, Jul 02 2016

a(n) ~ 40n log n. - Charles R Greathouse IV, Jul 02 2016

A142213 Primes congruent to 16 mod 41.

Original entry on oeis.org

139, 467, 631, 877, 1123, 1451, 1697, 1861, 2927, 3583, 3911, 4157, 4567, 4649, 4813, 5059, 5387, 5879, 6043, 6781, 6863, 7027, 7109, 8011, 8093, 8831, 9241, 9323, 9733, 10061, 10799, 11701, 11783, 13177, 13259, 13669, 13751, 13997, 14243, 14407, 14489

Offset: 1

N. J. A. Sloane, Jul 11 2008

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

Cf. A000040, A059236, A142199, A142200, A142212.

[p: p in PrimesUpTo(16000) | p mod 41 eq 16 ]; // Vincenzo Librandi, Aug 23 2012

Select[Range[16,30000,41],PrimeQ] (* Vladimir Joseph Stephan Orlovsky, May 17 2011 *)
Select[Prime[Range[5000]],MemberQ[{16},Mod[#,41]]&] (* Vincenzo Librandi, Aug 23 2012 *)

is(n)=isprime(n) && n%41==16 \\ Charles R Greathouse IV, Jul 02 2016

a(n) ~ 40n log n. - Charles R Greathouse IV, Jul 02 2016

A190758 Primes p such that x^41 = 2 has a solution mod p, and p is congruent to 1 mod 41.

Original entry on oeis.org

17467, 18287, 31817, 42641, 116359, 139483, 163673, 172283, 176383, 181549, 190979, 225829, 226813, 231323, 259531, 288313, 299137, 307009, 352109, 404507, 421891, 445097, 464777, 484621, 528163, 592861, 604997, 609179, 611393, 629843

Offset: 1

Klaus Brockhaus, May 18 2011

nonn

Klaus Brockhaus, Table of n, a(n) for n = 1..5000

Cf. A049573, A059236, A142199.

forprime(p=2, 700000, if(trap(, 0, sqrtn(Mod(2, p), 41); 1), if(p%41==1, print1(p, ", "))));

A212379 Primes congruent to 1 mod 41.

Original entry on oeis.org

83, 739, 821, 1231, 1559, 1723, 2297, 2543, 2707, 2789, 2953, 3527, 3691, 4019, 5003, 5167, 5413, 5659, 5741, 5987, 6151, 6397, 6971, 7873, 8447, 8693, 9103, 9349, 9431, 9677, 9923, 10169, 10333, 11071, 11317, 11399, 12301, 12547, 13121, 13367, 13613, 13859

Offset: 1

Bruno Berselli, Sep 20 2012

Coincides for the first 49 terms with A059236, that is the sequence of primes p such that x^41 = 2 has no solution mod p (first divergence is at 17467).

Bruno Berselli, Table of n, a(n) for n = 1..1000

Cf. A000040, A059236, A142199-A142237.

[p: p in PrimesUpTo(14000) | IsOne(p mod 41)];

Select[Prime[Range[1800]], Mod[#, 41] == 1 &]
Select[Range[1, 14000, 41], PrimeQ]

select(p->p%41==1, primes(999)) \\ Charles R Greathouse IV, Sep 20 2012

A142202 Primes congruent to 5 mod 41.

Original entry on oeis.org

5, 251, 661, 743, 907, 1153, 1399, 1481, 1973, 2137, 2383, 2711, 2957, 3121, 3203, 3449, 3613, 4597, 4679, 5171, 5417, 5581, 5827, 6073, 7057, 7549, 7877, 8123, 8287, 8369, 8779, 8861, 10009, 10091, 10337, 10501, 10993, 11239, 11321, 11731, 11813, 13043

Offset: 1

N. J. A. Sloane, Jul 11 2008

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

Cf. A000040, A059236, A142199, A142200, A142201.

[p: p in PrimesUpTo(14000) | p mod 41 eq 5 ]; // Vincenzo Librandi, Aug 23 2012

Select[Range[5,30000,41],PrimeQ] (* Vladimir Joseph Stephan Orlovsky, May 17 2011 *)
Select[Prime[Range[50000]],MemberQ[{5},Mod[#,41]]&] (* Vincenzo Librandi, Aug 23 2012 *)

is(n)=isprime(n) && n%41==5 \\ Charles R Greathouse IV, Jul 03 2016

a(n) ~ 40n log n. - Charles R Greathouse IV, Jul 03 2016

A142203 Primes congruent to 6 mod 41.

Original entry on oeis.org

47, 211, 293, 457, 1031, 1277, 1523, 1933, 2179, 2671, 2753, 2917, 2999, 3163, 3491, 4229, 4639, 4721, 4967, 5623, 5869, 6197, 6361, 6607, 6689, 7591, 7673, 7919, 8329, 8821, 9067, 9887, 10133, 10789, 11117, 11527, 12101, 12347, 12511, 12757, 13003, 13249

Offset: 1

N. J. A. Sloane, Jul 11 2008

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

Cf. A000040, A059236, A142199, A142200.

[p: p in PrimesUpTo(14000) | p mod 41 eq 6 ]; // Vincenzo Librandi, Aug 23 2012

Select[Range[6,30000,41],PrimeQ] (* Vladimir Joseph Stephan Orlovsky, May 17 2011 *)
Select[Prime[Range[5000]],MemberQ[{6},Mod[#,41]]&] (* Vincenzo Librandi, Aug 23 2012 *)

is(n)=isprime(n) && n%41==6 \\ Charles R Greathouse IV, Jul 03 2016

a(n) ~ 40n log n. - Charles R Greathouse IV, Jul 03 2016

cp's OEIS Frontend

A142212 Primes congruent to 15 mod 41.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A142213 Primes congruent to 16 mod 41.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A190758 Primes p such that x^41 = 2 has a solution mod p, and p is congruent to 1 mod 41.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

A212379 Primes congruent to 1 mod 41.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

A142202 Primes congruent to 5 mod 41.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A142203 Primes congruent to 6 mod 41.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula