A046933 - OEIS

This site is supported by donations to The OEIS Foundation.

A046933

Number of composites between successive primes.

0, 1, 1, 3, 1, 3, 1, 3, 5, 1, 5, 3, 1, 3, 5, 5, 1, 5, 3, 1, 5, 3, 5, 7, 3, 1, 3, 1, 3, 13, 3, 5, 1, 9, 1, 5, 5, 3, 5, 5, 1, 9, 1, 3, 1, 11, 11, 3, 1, 3, 5, 1, 9, 5, 5, 5, 1, 5, 3, 1, 9, 13, 3, 1, 3, 13, 5, 9, 1, 3, 5, 7, 5, 5, 3, 5, 7, 3, 7, 9, 1, 9, 1, 5, 3, 5, 7, 3, 1, 3, 11, 7, 3, 7, 3, 5, 11, 1, 17 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,4`
	COMMENTS	`A046933(n) = A001223(n) - 1 for all n.` `nth odd number of A028334(k). [From Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Apr 19 2010]`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000`
	FORMULA	`a(n) = p(n+1) - p(n) - 1`
	EXAMPLE	`a(1) = 0 since 2 is adjacent to 3; a(2) = 1 since 4 is between 3 and 5; a(4) = 3 = 11 - 7 - 1, etc`
	MATHEMATICA	`Differences[Prime[Range[100]]] - 1 (* Arkadiusz Wesolowski, Nov 18 2011 *)`
	CROSSREFS	`Cf. A028334 [From Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Apr 19 2010]` `Sequence in context: A110919 A109599 A066839 * A185091 A023511 A035628` `Adjacent sequences: A046930 A046931 A046932 * A046934 A046935 A046936`
	KEYWORD	`easy,nonn,nice`
	AUTHOR	`Marc LeBrun (mlb(AT)well.com)`

Content is available under The OEIS End-User License Agreement .

Last modified February 16 23:45 EST 2012. Contains 205978 sequences.