Number of sets 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.
A293745
Number of sets 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) =2a(3) =6a(4) =15a(5) =45a(6) =136a(7) =429a(8) =1406a(9) =4771a(10) =16749a(11) =60453a(12) =224948a(13) =857010a(14) =3350574a(15) =13366375a(16) =54494538a(17) =226020624a(18) =954737292a(19) =4092229831a(20) =17813005015a(21) =78509835288a(22) =350592604663
External references
- oeis: A293745