id:A096500 - OEIS Search Results

Search: id:A096500

Displaying 1-1 of 1 results found.

page 1

Let f(n) = smallest prime > n; a(n) = f(n+1) - f(n).

+0
2

1, 2, 0, 2, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 2, 0, 6, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 6, 0, 0, 0, 0, 0, 2, 0, 6, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 0, 6, 0, 0, 0, 0, 0, 4, 0, 0, 0, 6, 0, 0, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 0, 4, 0, 0, 0 (list; graph; listen)

	OFFSET	`1,2`
	MATHEMATICA	<<NumberTheory`NumberTheoryFunctions` Table[NextPrime[n+1]-NextPrime[n], {n, 1, 256}]
	CROSSREFS	`Cf. A096501, A001223.` `Sequence in context: A136166 A046522 A112631 this_sequence A111813 A132952 A029187` `Adjacent sequences: A096497 A096498 A096499 this_sequence A096501 A096502 A096503`
	KEYWORD	`nonn`
	AUTHOR	`Labos E. (labos(AT)ana.sote.hu), Jul 09 2004`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research