id:A087102 - OEIS Search Results

Search: id:A087102

Displaying 1-1 of 1 results found.

page 1

Number of numbers occurring most frequently as difference between consecutive primes <= prime(n).

+0
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; listen)

	OFFSET	`2,2`
	COMMENT	`For small n: a(n)<=3; A087103(n) and A087104(n) give the smallest and greatest jumping champion(s) 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: A078315 A156264 A160322 this_sequence A113515 A103754 A058665` `Adjacent sequences: A087099 A087100 A087101 this_sequence A087103 A087104 A087105`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Aug 10 2003`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research