login
Number of n-length words w over 9-ary 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.
1

%I #4 Jun 15 2012 03:54:33

%S 1,9,81,621,4293,26061,140517,676155,2990967,12602451,52359693,

%T 216954441,901911273,3778512489,16012113225,68739345546,299377174968,

%U 1323228682218,5939020708851,27063683050245,125241936884631,588324477445971,2805460966739493

%N Number of n-length words w over 9-ary 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.

%Y Column k=9 of A213276.

%K nonn

%O 0,2

%A _Alois P. Heinz_, Jun 08 2012