61489
domain: N
Appears in sequences
- G.f.: Product_{k>0} (1+x^k)/((1-x^k)*(1+x^(3k))*(1+x^(5k))).at n=32A100823
- Number of words w of length n such that each letter of the binary alphabet is used at least once and 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=16A321838
- Expansion of e.g.f. exp(x/(1 - x^3)^(1/3)).at n=9A373517