A213297 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, 9, 81, 621, 4293, 26061, 140517, 676155, 2990967, 12602451, 52359693, 216954441, 901911273, 3778512489, 16012113225, 68739345546, 299377174968, 1323228682218, 5939020708851, 27063683050245, 125241936884631, 588324477445971, 2805460966739493

Offset

0,2

Links

Table of n, a(n) for n=0..22.

Crossrefs

Column k=9 of A213276.

Sequence in context: A218268 A223882 A267961 * A272243 A272242 A206728

Adjacent sequences: A213294 A213295 A213296 * A213298 A213299 A213300

Keyword

nonn

Author

Alois P. Heinz, Jun 08 2012

Status

approved