A285894 Number of length-n binary sequences whose subword complexity is <= 2i, for all i.

1, 2, 4, 8, 16, 32, 64, 128, 256, 472, 856, 1494, 2494, 4060, 6460, 10002, 15170, 22492, 32596, 46824, 66076, 91716, 125784, 170582, 227426, 302210, 396144, 514540, 663740, 850580, 1078628, 1362312

Offset: 0

Author

Jeffrey Shallit, Apr 28 2017

Keywords

• nonn

Comments

The subword complexity of a finite or infinite sequence i is the function sending i to the number of distinct length-i blocks appearing in s.

Links

• G. Rote, Sequences With Subword Complexity 2n, J. Number Theory 46 (1994), 196-213.

Crossrefs

Cf. A260881, which counts the same thing for subword complexity <= i+1 instead of <= 2i.