id:A119900 - OEIS Search Results

Search: id:A119900

Displaying 1-1 of 1 results found.

page 1

A119900

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).

+0
5

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, 8, 56, 56, 8, 0, 0, 0, 0, 1, 36, 126, 84, 9, 0, 0, 0, 0, 0, 10, 120, 252, 120, 10, 0, 0, 0, 0, 0, 1, 55, 330, 462, 165, 11, 0, 0, 0, 0, 0, 0, 12, 220, 792, 792, 220, 12, 0, 0, 0, 0, 0, 0, 1, 78 (list; graph; listen)

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research