cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A280417 Number of distinct length-n blocks (a.k.a. subword complexity) of the characteristic sequence of the prime numbers A010051.

Original entry on oeis.org

1, 2, 4, 7, 9, 13, 16, 22, 28, 38, 48, 62, 76, 104, 132, 174, 216, 273, 330, 435, 540, 700, 860
Offset: 0

Views

Author

Jeffrey Shallit, Jan 02 2017

Keywords

Comments

Unlike A023192, this sequence also counts blocks that occur finitely often in A010051. And unlike A023192, the correctness of the numbers provided here depend on no conjecture.

Examples

			For n = 4, the 9 blocks (in the order they occur in A010051) are 0110,1101,1010,0101,0100,1000,0001,0010,0000.
		

Crossrefs

Cf. A010051, A023192. A280418 gives the length of shortest prefix needed to get all blocks that occur.