**Triangle read by rows: T(n,k) is the number of binary words of length n with k strictly increasing runs (0<=k<=n; for example, the binary word 1/0/01/01/1/1/01 has 7 strictly increasing runs).**

*1, 0, 2, 0, 1, 3, 0, 0, 4, 4, 0, 0, 1, 10, 5, 0, 0, 0, 6, 20, 6, 0, 0, 0, 1, 21, 35, 7, 0, 0, 0, 0*

*2 seqfan posts*

Index of A-numbers in seqfan: by ascending order by month by frequency by keyword

Links to OEIS content are included according to The OEIS End-User License Agreement .