Number of sets of exactly four nonempty words with a total of n letters over n-ary alphabet such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
A293966
Number of sets of exactly four nonempty words with a total of n letters over n-ary 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) =4a(1) =22a(2) =116a(3) =482a(4) =1966a(5) =7682a(6) =29845a(7) =115438a(8) =449870a(9) =1770788a(10) =7073065a(11) =28727652a(12) =118907910a(13) =502249944a(14) =2167410896a(15) =9563204836a(16) =43166853057a(17) =199391604156a(18) =942578850020
External references
- oeis: A293966