|
|
A293739
|
|
Number of multisets of nonempty words with a total of n letters over nonary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
|
|
5
|
|
|
1, 1, 3, 7, 20, 54, 164, 500, 1630, 5472, 19256, 70121, 265723, 1041184, 4225484, 17689505, 76392933, 339283021, 1548592471, 7246210567, 34725853445, 170096822940, 850715642495, 4337263437693, 22519434992230, 118916581795167, 638088881489144, 3475474084479428
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
This sequence differs from A293110 first at n=10.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: Product_{j>=1} 1/(1-x^j)^A212915(j).
a(n) ~ c * 9^n / n^18, where c = 978644175524508179.918397627321774... - Vaclav Kotesovec, Dec 19 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|