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.
%I A280417 #8 Dec 26 2021 23:34:05 %S A280417 1,2,4,7,9,13,16,22,28,38,48,62,76,104,132,174,216,273,330,435,540, %T A280417 700,860 %N A280417 Number of distinct length-n blocks (a.k.a. subword complexity) of the characteristic sequence of the prime numbers A010051. %C A280417 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. %e A280417 For n = 4, the 9 blocks (in the order they occur in A010051) are 0110,1101,1010,0101,0100,1000,0001,0010,0000. %Y A280417 Cf. A010051, A023192. A280418 gives the length of shortest prefix needed to get all blocks that occur. %K A280417 nonn,more %O A280417 0,2 %A A280417 _Jeffrey Shallit_, Jan 02 2017