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

A141857
Primes congruent to 10 mod 11.
6
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,1
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
FORMULA
a(n) ~ 10n log n. - Charles R Greathouse IV, Jul 02 2016
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 *)
PROG
(Magma) [ p: p in PrimesUpTo(5000) | p mod 11 eq 10 ]; // Vincenzo Librandi, Apr 19 2011
(PARI) is(n)=isprime(n) && n%11==10 \\ Charles R Greathouse IV, Jul 02 2016
CROSSREFS
Cf. A002386.
Sequence in context: A142944 A334641 A059914 * A106923 A115586 A294717
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Jul 11 2008
STATUS
approved