Number of multisets of nonempty words with a total of n letters over senary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.

A293736

Number of multisets of nonempty words with a total of n letters over senary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.

Terms

    a(0) =1a(1) =1a(2) =3a(3) =7a(4) =20a(5) =54a(6) =164a(7) =499a(8) =1621a(9) =5397a(10) =18762a(11) =67000a(12) =247439a(13) =936167a(14) =3639968a(15) =14450634a(16) =58677742a(17) =242511781a(18) =1021307520a(19) =4365923278a(20) =18960435664a(21) =83395216882a(22) =371734296357

External references