id:A087103 - OEIS Search Results

Search: id:A087103

Displaying 1-1 of 1 results found.

page 1

Smallest jumping champion for prime(n).

+0
4

1, 1, 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, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 6, 6, 6, 2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 6 (list; graph; listen)

	OFFSET	`2,3`
	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; A087104(n) is the greatest jumping champion for prime(n).`
	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: A163857 A111893 A121902 this_sequence A111972 A073458 A105519` `Adjacent sequences: A087100 A087101 A087102 this_sequence A087104 A087105 A087106`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 10 2003`

page 1

Search completed in 0.002 seconds

Last modified March 20 01:21 EDT 2010. Contains 173643 sequences.

AT&T Labs Research