A278554 Number of distinct blocks of length n (a.k.a. subword complexity) of the characteristic sequence of the squarefree numbers A008966.

1, 2, 4, 8, 15, 29, 55, 101, 175, 323, 583

Offset: 0

Author

Jeffrey Shallit, Jan 02 2017

Keywords

• nonn
• more

Comments

Conjecture 1: this is the number of binary sequences S of length n such that, for all primes p such that p^2 <= n, at least one of the p^2 linearly indexed subsequences of S with gap p^2 starting at the 1st, 2nd, ..., p^2-th position of S, is the all-zeros sequence. In other words, every block that is not explicitly ruled out by congruence conditions for the primes p with p^2 <= n should occur.

Conjecture 2: the last new block to actually occur is always 0^n (n copies of 0). Cf. A020754.

Examples

			For n = 5, the 3 blocks of length 5 that do not occur are 11111, 11110, and 01111.
		

Crossrefs

Cf. A008966, A020754.