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 A285894 #21 Jan 22 2020 08:08:20 %S A285894 1,2,4,8,16,32,64,128,256,472,856,1494,2494,4060,6460,10002,15170, %T A285894 22492,32596,46824,66076,91716,125784,170582,227426,302210,396144, %U A285894 514540,663740,850580,1078628,1362312 %N A285894 Number of length-n binary sequences whose subword complexity is <= 2i, for all i. %C A285894 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. %H A285894 G. Rote, <a href="https://doi.org/10.1006/jnth.1994.1012">Sequences With Subword Complexity 2n</a>, J. Number Theory 46 (1994), 196-213. %Y A285894 Cf. A260881, which counts the same thing for subword complexity <= i+1 instead of <= 2i. %K A285894 nonn %O A285894 0,2 %A A285894 _Jeffrey Shallit_, Apr 28 2017