1704795domain: NAppears in sequencesA diagonal of rectangular table A208896: a(n) = A208896(n+1,n).at n=8A208897Number of n-length words w over binary alphabet such that for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z.at n=23A213290