id:A046933 - OEIS Search Results

Search: id:A046933

Displaying 1-1 of 1 results found.

page 1

Number of composites between successive primes.

+0
12

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

	OFFSET	`1,4`
	COMMENT	`A046933(n) = A001223(n) - 1 for all n.`
	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`
	CROSSREFS	`Sequence in context: A110919 A109599 A066839 this_sequence A023511 A035628 A057024` `Adjacent sequences: A046930 A046931 A046932 this_sequence A046934 A046935 A046936`
	KEYWORD	`easy,nonn,nice`
	AUTHOR	`Marc LeBrun (mlb(AT)well.com)`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research