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 A229293 #8 Dec 23 2013 12:41:05 %S A229293 1,1,1,1,4,1,1,1,1,18,1,6,1,1,40,1,8,1,4,33,1,1,17,42,1120,1,12,11, %T A229293 448,1,1,1,84,52,1,985,1,10,1,316,3360,1,1,75,144,1,1,12,1,504,180,15, %U A229293 7920,102,1,16,220,14,11440,17,1,1,264,1,20,3206,399,1,4 %N A229293 Number of binary words of length n with exactly k (possibly overlapping) occurrences of the subword given by the binary expansion of n for maximal k with at least one word. %H A229293 Alois P. Heinz, <a href="/A229293/b229293.txt">Table of n, a(n) for n = 0..1000</a> %e A229293 a(4) = 4 because there are 4 binary words of length 4 with one occurrence of 100, namely 0100, 1000, 1001, 1100, and no words with more than one occurrence of 100. %Y A229293 Last (positive) terms of rows of A233940. %K A229293 nonn %O A229293 0,5 %A A229293 _Alois P. Heinz_, Dec 18 2013