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.

A371662 Number of binary strings of length n with more 000 than 001 substrings.

Original entry on oeis.org

0, 0, 0, 1, 2, 5, 11, 26, 56, 121, 255, 539, 1123, 2332, 4808, 9891, 20262, 41413, 84411, 171760, 348857, 707593, 1433315, 2900313, 5863023, 11842460
Offset: 0

Views

Author

Robert P. P. McKone, Apr 03 2024

Keywords

Examples

			a(5) = 5: 00000, 00001, 01000, 10000, 11000.
a(6) = 11: 000000, 000001, 000010, 000011, 010000, 011000, 100000, 100001, 101000, 110000, 111000.
		

Crossrefs

Cf. A164137 (equal 000 and 001), A371682 (more 001 than 000).

Programs

  • Mathematica
    tup[n_] := Tuples[{0, 1}, n];
    cou[lst_List] := Count[lst, {0, 0, 0}] > Count[lst, {0, 0, 1}];
    par[lst_List] := Partition[lst, 3, 1];
    a[n_] := a[n] = Map[cou, Map[par, tup[n]]] // Boole // Total;
    Monitor[Table[a[n], {n, 0, 23}], {n, Table[a[m], {m, 0, n - 1}]}]

Formula

a(n) = 2^n - A164137(n) - A371682(n).