|
|
A293111
|
|
Number of multisets of nonempty words with a total of 2n letters over n-ary alphabet containing the n-th letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
|
|
3
|
|
|
1, 2, 10, 58, 439, 3767, 37481, 405672, 4816390, 60748286, 817467196, 11533898929, 170979909037, 2635984019533, 42297026556483, 701880878089205, 12045976560853148, 212911592290588547, 3874514946593004395, 72378921228197309169, 1387364840045160600103
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|