|
|
A213298
|
|
Number of n-length words w over 10-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
|
|
|
1, 10, 100, 865, 6805, 47590, 297595, 1662160, 8418649, 39598078, 178880725, 795246055, 3519278713, 15573399301, 69314501935, 311040898945, 1411268823196, 6478030875460, 30129403442530, 141971859499360, 678365095896001, 3285531463054108, 16137537771997720
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|