88368

Appears in sequences

• Number of binary words of length n containing no subword 11011.at n=17A210021
• Number of n-length words w over ternary 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=13A213291
• Number T(n,k) of binary words of length n containing exactly k (possibly overlapping) occurrences of the subword 11011; triangle T(n,k), n>=0, k=0..max(0,floor((n-2)/3)), read by rows.at n=47A277678
• Square array A(n,k), n>=0, k>=0, read by antidiagonals downwards, where column k is the expansion of e.g.f. 1/(1 - x*(exp(x) - 1)^k).at n=63A392817
• Expansion of e.g.f. 1/(1 - x*(exp(x) - 1)^2).at n=8A392820