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 A186403 #32 Mar 22 2024 03:47:25 %S A186403 13,25,29,32,34,38,39,44,51,61,65,72,74,80,87,90,92,93,97,100,107,111, %T A186403 114,121,130,134,139,154,170,181,182,183,184,187,190,192,195,210,213, %U A186403 217,218,227,249,251,261,262,267,279,280 %N A186403 Numbers k such that there are 11 primes between 100*k and 100*k + 99. %C A186403 There are 24942742 possible prime patterns for centuries having 11 primes. - _Tim Johannes Ohrtmann_, Aug 27 2015 %H A186403 T. D. Noe, <a href="/A186403/b186403.txt">Table of n, a(n) for n = 1..1000</a> %e A186403 13 is in this sequence because there are 11 primes between 1300 and 1399 (1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381 and 1399). %t A186403 Select[Range[300],PrimePi[100#+99]-PrimePi[100#]==11&] (* _Harvey P. Dale_, Jul 26 2011 *) %o A186403 (PARI) for(n=1, 1e6, if(sum(k=100*n, 100*(n+1), ispseudoprime(k))==11, print1(n", "))); \\ _Charles R Greathouse IV_, Feb 21 2011 %o A186403 (PARI) N=100; s=0; forprime(p=2, 4e9, if(p>N, if(s==11, print1((N\100)-1, ", ")); s=1; N=100*(p\100+1), s++)) \\ _Charles R Greathouse IV_, Feb 21 2011 %Y A186403 Cf. A038822 (number of primes between 100n and 100n+99), A186311 (first occurrences). %Y A186403 Cf. A181098 (no primes), A186393-A186408 (1 to 16 primes), A186509 (17 primes), A361723 (18 primes). %K A186403 nonn %O A186403 1,1 %A A186403 _Tim Johannes Ohrtmann_, Feb 20 2011