|
Search: id:A087104
|
|
|
| A087104 |
|
Greatest jumping champion for prime(n). |
|
+0
4
|
|
| 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 4, 2, 4, 4, 4, 4, 4, 4, 2, 2, 2, 4, 4, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6, 6, 6, 6, 6, 6, 6, 6, 2, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 6, 6, 6
(list; graph; listen)
|
|
|
OFFSET
|
2,2
|
|
|
COMMENT
|
A number is called a jumping champion for n, if it is the most frequently occurring difference between consecutive primes <= n;
there are occasionally several jumping champions: see A087102; A087103(n) is the smallest jumping champion for prime(n);
a(n)<=6 for small n, see Odlyzko et al. for primes>1.7*10^35.
|
|
REFERENCES
|
A. Odlyzko, M. Rubinstein and M. Wolf, Jumping Champions, Experimental Math., 8 (no. 2) (1999).
|
|
LINKS
|
A. Odlyzko, M. Rubinstein and M. Wolf, Jumping Champions
Eric Weisstein's World of Mathematics, Jumping Champion
A. Odlyzko, M. Rubinstein and M. Wolf, Jumping Champions, Experimental Math., 8 (no. 2) (1999).
|
|
CROSSREFS
|
Cf. A001223, A005250.
Sequence in context: A086858 A111892 A108248 this_sequence A069926 A077429 A060417
Adjacent sequences: A087101 A087102 A087103 this_sequence A087105 A087106 A087107
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 10 2003
|
|
|
Search completed in 0.002 seconds
|
