This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A141857 #31 Oct 01 2024 03:31:51 %S A141857 43,109,131,197,241,263,307,373,439,461,571,593,659,769,857,967,1033, %T A141857 1187,1231,1297,1319,1429,1451,1583,1627,1693,1759,1847,1913,1979, %U A141857 2089,2111,2221,2243,2287,2309,2441,2551,2617,2683,2749,2837,2903,2969,3079,3167 %N A141857 Primes congruent to 10 mod 11. %C A141857 From _N. J. A. Sloane_, Jan 29 2014: (Start) %C A141857 If p = 11k+10 then k must be odd, so p is also of the form 22r+21. %C A141857 Note that the differences are surely unbounded - compare A002386. (End) %H A141857 Vincenzo Librandi, <a href="/A141857/b141857.txt">Table of n, a(n) for n = 1..1000</a> %F A141857 a(n) ~ 10n log n. - _Charles R Greathouse IV_, Jul 02 2016 %t A141857 Select[Range[10, 50000, 11], PrimeQ] (* _Vladimir Joseph Stephan Orlovsky_, Jun 13 2011 *) %t A141857 Select[Range[43, 50000, 22], PrimeQ] (* _Zak Seidov_, Jan 29 2014 *) %t A141857 Select[Prime[Range[500]],Mod[#,11]==10&] (* _Harvey P. Dale_, Jan 10 2023 *) %o A141857 (Magma) [ p: p in PrimesUpTo(5000) | p mod 11 eq 10 ]; // _Vincenzo Librandi_, Apr 19 2011 %o A141857 (PARI) is(n)=isprime(n) && n%11==10 \\ _Charles R Greathouse IV_, Jul 02 2016 %Y A141857 Cf. A002386. %K A141857 nonn,easy %O A141857 1,1 %A A141857 _N. J. A. Sloane_, Jul 11 2008