id:A047947 - OEIS Search Results

Search: id:A047947

Displaying 1-1 of 1 results found.

page 1

Schinzel's rhobar(n), number of distinct lengths of a block of consecutive integers on which a maximum of n primes occurs infinitely often (under the k-tuple conjecture).

+0
4

2, 4, 2, 4, 4, 4, 6, 4, 2, 4, 6, 6, 2, 6, 4, 6, 4, 6, 4, 4, 6, 4, 6, 10, 4, 6, 6, 4, 6, 4, 6, 6, 4, 2, 4, 6, 8, 6, 4, 2, 8, 4, 10, 2, 4, 10, 10, 4, 6, 6, 2, 10, 6, 2, 6, 4, 6, 12, 4, 6, 10, 4, 6, 6, 6, 8, 6, 10, 4, 8, 6, 6, 2, 6, 12, 10, 2, 4, 6, 6, 8, 4, 2, 10, 8, 6, 6, 4, 8, 10, 2, 6, 4, 2 (list; graph; listen)

	OFFSET	`0,1`
	REFERENCES	`Computed by Achim Flammenkamp [ achim(AT)uni-bielefeld.de ].`
	EXAMPLE	`A block of 21 through 26 consecutive integers may contain at most 7 primes infinitely often. There are 6 possible lengths (21 through 26), so rhobar(7) = 6.`
	CROSSREFS	`First differences of A020497.` `Sequence in context: A004020 A143235 A069465 this_sequence A018838 A116982 A143271` `Adjacent sequences: A047944 A047945 A047946 this_sequence A047948 A047949 A047950`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified December 4 12:44 EST 2009. Contains 170310 sequences.

AT&T Labs Research