|
Search: id:A086139
|
|
|
| A086139 |
|
Number of primes between p and p+12 if p is prime, i.e. number of primes somewhere between 12+A023203[n] and A023203[n]. |
|
+0
2
|
|
| 3, 3, 3, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 3, 3, 2, 1, 1, 1, 1, 1, 1, 0, 0, 2, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 1, 0, 1, 1, 1, 0, 1, 1, 1, 2, 0, 1, 2, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 0, 1, 0, 2, 2, 2, 2, 0, 1, 2, 1, 2, 0, 1, 3, 2, 0, 0, 0, 1, 1, 1, 2, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(n)=0,1,2,3 correspond to {p,p+12} prime-pairs either
consecutive(0) ones or those with various d-patterns(1,2,3);
0 between [199,211];1 for [89,101];2 like for [19,31];
3 primes in interval [7,19].
|
|
MAPLE
|
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; d=12
|
|
CROSSREFS
|
Cf. A046133, A031930, A031931.
Sequence in context: A136218 A112106 A010608 this_sequence A074804 A075074 A087497
Adjacent sequences: A086136 A086137 A086138 this_sequence A086140 A086141 A086142
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jul 29 2003
|
|
|
Search completed in 0.002 seconds
|
