The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086137 Number of primes between p and p+8 if p is prime, i.e., number of primes between 8+A023202(n) and A023202(n). 0
2, 2, 2, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 2, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 2, 0, 0, 0, 1, 1, 1, 0, 0, 2, 0, 0, 2, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 2, 1, 1, 0, 2, 0, 1, 1, 0, 0, 0, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(n)=0,1,2 correspond to {p,p+8} prime-pairs either consecutive or pairs with various d-patterns as follows:
a(n)=0 to 89[8]97; a(n)=1 for 29[2,6]37, 53[6,2];
a(n)=2 for 101[2,4,2]109 and once to 3[2,2,4]11.
MATHEMATICA
cp[x_, y_] := Count[Table[PrimeQ[i], {i, x, y}], True] Do[s=Prime[n]; s1=Prime[n+1]; If[PrimeQ[s+d], k=k+1; Print[cp[s+1, s+d-1]]], {n, 1, 1000}]; k
CROSSREFS
Sequence in context: A004571 A204429 A292560 * A085976 A171624 A032548
KEYWORD
nonn
AUTHOR
Labos Elemer, Jul 29 2003
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 5 18:30 EDT 2024. Contains 373107 sequences. (Running on oeis4.)