cp's OEIS Frontend

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.

A186399 Numbers k such that there are 7 primes between 100*k and 100*k + 99.

This page as a plain text file.
%I A186399 #30 Mar 22 2024 03:45:26
%S A186399 59,95,142,165,167,191,196,206,212,242,252,281,283,297,299,318,349,
%T A186399 357,372,385,394,406,407,414,417,425,431,433,452,457,459,462,470,480,
%U A186399 482,504,510,533,551,555,563,585,595,599,604
%N A186399 Numbers k such that there are 7 primes between 100*k and 100*k + 99.
%C A186399 There are 2459376 possible prime patterns for centuries having 7 primes. - _Tim Johannes Ohrtmann_, Aug 27 2015
%H A186399 T. D. Noe, <a href="/A186399/b186399.txt">Table of n, a(n) for n = 1..1000</a>
%e A186399 59 is in this sequence because there are 7 primes between 5900 and 5999 (5903, 5923, 5927, 5939, 5953, 5981 and 5987).
%t A186399 Select[Range[610],PrimePi[100#+99]-PrimePi[100#]==7&] (* _Harvey P. Dale_, Nov 05 2011 *)
%o A186399 (PARI) for(n=1, 1e6, if(sum(k=100*n, 100*(n+1), ispseudoprime(k))==7, print1(n", "))); \\ _Charles R Greathouse IV_, Feb 21 2011
%o A186399 (PARI) N=100; s=0; forprime(p=2, 1e6, if(p>N, if(s==7, print1((N\100)-1, ", ")); s=1; N=100*(p\100+1), s++)) \\ _Charles R Greathouse IV_, Feb 21 2011
%Y A186399 Cf. A038822 (number of primes between 100n and 100n+99), A186311 (first occurrences).
%Y A186399 Cf. A181098 (no primes), A186393-A186408 (1 to 16 primes), A186509 (17 primes), A361723 (18 primes).
%K A186399 nonn
%O A186399 1,1
%A A186399 _Tim Johannes Ohrtmann_, Feb 20 2011