|
| |
|
|
A087102
|
|
Number of numbers occurring most frequently as difference between consecutive primes <= prime(n).
|
|
3
| |
|
|
1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 2, 1, 1, 1, 2, 2, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 2, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 2,2
|
|
|
COMMENTS
| For small n: a(n)<=3; A087103(n) and A087104(n) give the smallest and greatest jumping champion(s) for prime(n).
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n = 2..1001
A. Odlyzko, M. Rubinstein and M. Wolf, Jumping Champions
A. Odlyzko, M. Rubinstein and M. Wolf, Jumping Champions, Experimental Math., 8 (no. 2) (1999).
Eric Weisstein's World of Mathematics, Jumping Champion
|
|
|
MATHEMATICA
| d=Table[0, {100}]; p=2; Table[q=NextPrime[p]; d[[q-p]]++; p=q; Length[Position[d, Max[d]]], {1000}]
|
|
|
CROSSREFS
| Cf. A001223, A005250.
Sequence in context: A078315 A156264 A160322 * A194309 A113515 A103754
Adjacent sequences: A087099 A087100 A087101 * A087103 A087104 A087105
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 10 2003
|
| |
|
|
