login
Number of words w of length n such that each letter of the quinary 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.
1

%I #3 Nov 19 2018 18:03:43

%S 120,360,1470,4872,17649,60465,218360,779649,2878543,10662640,

%T 40402105,154308568,599106195,2346709225,9308176915,37232621263,

%U 150428771629,612404221280,2513790671891,10388482748377,43231607141305,180987402799559,762252080995334

%N Number of words w of length n such that each letter of the quinary 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.

%Y Column k=5 of A257783.

%K nonn

%O 5,1

%A _Alois P. Heinz_, Nov 19 2018