A141857 Primes congruent to 10 mod 11.

43, 109, 131, 197, 241, 263, 307, 373, 439, 461, 571, 593, 659, 769, 857, 967, 1033, 1187, 1231, 1297, 1319, 1429, 1451, 1583, 1627, 1693, 1759, 1847, 1913, 1979, 2089, 2111, 2221, 2243, 2287, 2309, 2441, 2551, 2617, 2683, 2749, 2837, 2903, 2969, 3079, 3167

Offset: 1

Author

N. J. A. Sloane, Jul 11 2008

Keywords

• nonn
• easy

Comments

From N. J. A. Sloane, Jan 29 2014: (Start)

If p = 11k+10 then k must be odd, so p is also of the form 22r+21.

Note that the differences are surely unbounded - compare A002386. (End)

Links

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

Crossrefs

Cf. A002386.

Programs

Magma

[ p: p in PrimesUpTo(5000) | p mod 11 eq 10 ]; // Vincenzo Librandi, Apr 19 2011

Mathematica

Select[Range[10, 50000, 11], PrimeQ] (* Vladimir Joseph Stephan Orlovsky, Jun 13 2011 *)
Select[Range[43, 50000, 22], PrimeQ] (* Zak Seidov, Jan 29 2014 *)
Select[Prime[Range[500]],Mod[#,11]==10&] (* Harvey P. Dale, Jan 10 2023 *)

PARI

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

Formula

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