|
Search: id:A086138
|
|
|
| A086138 |
|
Number of primes between p and p+10 if p is prime, i.e. number of primes somewhere between 10+A023203[n] and A023203[n]. |
|
+0
2
|
|
| 3, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 0, 1, 1, 0, 2, 1, 0, 1, 0, 2, 0, 1, 1, 1, 0, 0, 1, 1, 2, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 2, 2, 0, 1, 1, 1, 0, 0, 0, 2, 1, 0, 0, 1, 0, 1, 1, 2, 0, 2, 1, 0, 2, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 2, 0, 1, 2, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
a(n)=0,1,2,3 correspond to {p,p+10} prime-pairs either
consecutive ones or those with various d-patterns like
as follows: a(n)=0 to cases like 139[10]149; a(n)=2 to
7[4,2,4]17 etc.; a(n)=3 to one case 3[2,2,4,2]13 and
a(n)=2 to cases like 31[6,4]37 or 43[4,6]53.
|
|
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=10
|
|
CROSSREFS
|
Cf. A023303, A031928, A031929.
Adjacent sequences: A086135 A086136 A086137 this_sequence A086139 A086140 A086141
Sequence in context: A131961 A010269 A077450 this_sequence A054546 A065310 A016558
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jul 29 2003
|
|
|
Search completed in 0.002 seconds
|
