Number of proper multisets of nonempty words with a total of n letters over n-ary alphabet such that if a letter occurs in the multiset all predecessors occur at least once.
A320265
Number of proper multisets of nonempty words with a total of n letters over n-ary alphabet such that if a letter occurs in the multiset all predecessors occur at least once.
Terms
- a(0) =1a(1) =3a(2) =23a(3) =178a(4) =1786a(5) =20927a(6) =282520a(7) =4299263a(8) =72750927a(9) =1353700567a(10) =27452623890a(11) =602326265519
External references
- oeis: A320265