|
Search: id:A086149
|
|
|
| A086149 |
|
Primes p so that the number of primes between p and p+32 equals 7. |
|
+0
2
|
|
| 29, 41, 416387, 626597, 6560987, 6937937, 25658429, 25658441, 29597411, 49136357, 51448361, 57405419, 90279461, 128469149, 137943341, 162189089, 165531251, 175182587
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Several similar examples exist: between smaller solutions there is a huge gap until further cases arise. It underlines that given a d, and a count number c, then values of p so that count c of primes between p and p+d are rather unpredictable.
|
|
MATHEMATICA
|
cp[x_, y_] := Count[Table[PrimeQ[i], {i, x, y}], True] Do[s=Prime[n]; s1=Prime[n+1]; If[PrimeQ[s+32]&& Equal[cp[s+1, s+d-1], 7], Print[s]], {n, 1, 1000000}]
|
|
CROSSREFS
|
Cf. A049489.
Sequence in context: A137226 A106019 A084163 this_sequence A066502 A125870 A076439
Adjacent sequences: A086146 A086147 A086148 this_sequence A086150 A086151 A086152
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana.sote.hu), Jul 29 2003
|
|
|
Search completed in 0.002 seconds
|
