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 A186407 #36 Mar 22 2024 03:46:05 %S A186407 8,12,16,22,23,26,33,40,49,63,75,94,375,424,1131,1572,3442,3922,7393, %T A186407 9780,13939,16528,17492,29673,71338,75877,237421,464977,514483,687352, %U A186407 747574,981953,1040840,1269778,1298137,1346413,1790287,1884223,2330647,2527249,2601874,2813749 %N A186407 Numbers k such that there are 15 primes between 100*k and 100*k + 99. %C A186407 There are 12815608 possible prime patterns for centuries having 15 primes. - _Tim Johannes Ohrtmann_, Aug 27 2015 %H A186407 Brian Kehrig, <a href="/A186407/b186407.txt">Table of n, a(n) for n = 1..1000</a> (terms 1..200 from T. D. Noe) %e A186407 8 is in this sequence because there are 15 primes between 800 and 899 (809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883 and 887). %o A186407 (PARI) for(n=1, 1e6, if(sum(k=100*n,100*(n+1), ispseudoprime(k))==15, print1(n", "))); \\ _Charles R Greathouse IV_, Feb 21 2011 %o A186407 (PARI) N=100; s=0; forprime(p=2, 4e9, if(p>N, if(s==15, print1((N\100)-1,", ")); s=1; N=100*(p\100+1),s++)) \\ _Charles R Greathouse IV_, Feb 21 2011 %Y A186407 Cf. A038822 (number of primes between 100n and 100n+99), A186311 (first occurrences). %Y A186407 Cf. A181098 (no primes), A186393-A186408 (1 to 16 primes), A186509 (17 primes), A361723 (18 primes). %K A186407 nonn %O A186407 1,1 %A A186407 _Tim Johannes Ohrtmann_, Feb 20 2011 %E A186407 a(19)-a(42) from _Charles R Greathouse IV_, Feb 21 2011