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 A371662 #30 Apr 03 2024 10:06:18
%S A371662 0,0,0,1,2,5,11,26,56,121,255,539,1123,2332,4808,9891,20262,41413,
%T A371662 84411,171760,348857,707593,1433315,2900313,5863023,11842460
%N A371662 Number of binary strings of length n with more 000 than 001 substrings.
%F A371662 a(n) = 2^n - A164137(n) - A371682(n).
%e A371662 a(5) = 5: 00000, 00001, 01000, 10000, 11000.
%e A371662 a(6) = 11: 000000, 000001, 000010, 000011, 010000, 011000, 100000, 100001, 101000, 110000, 111000.
%t A371662 tup[n_] := Tuples[{0, 1}, n];
%t A371662 cou[lst_List] := Count[lst, {0, 0, 0}] > Count[lst, {0, 0, 1}];
%t A371662 par[lst_List] := Partition[lst, 3, 1];
%t A371662 a[n_] := a[n] = Map[cou, Map[par, tup[n]]] // Boole // Total;
%t A371662 Monitor[Table[a[n], {n, 0, 23}], {n, Table[a[m], {m, 0, n - 1}]}]
%Y A371662 Cf. A164137 (equal 000 and 001), A371682 (more 001 than 000).
%K A371662 nonn,more
%O A371662 0,5
%A A371662 _Robert P. P. McKone_, Apr 03 2024