A047947 - OEIS

A047947

a(n) is the number of k values for which A023193(k) = n.

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; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

The old name was: "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)." [Note that "rhobar" is A023193.]

REFERENCES

Computed by Achim Flammenkamp.

LINKS

Table of n, a(n) for n=1..94.

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. Cf. A008407, A023193.

Sequence in context: A246436 A143235 A069465 * A018838 A116982 A216621

Adjacent sequences: A047944 A047945 A047946 * A047948 A047949 A047950

KEYWORD

nonn

AUTHOR

David W. Wilson

EXTENSIONS

Definition corrected by Wolfdieter Lang, Oct 07 2017

STATUS

approved