Number of sets of nonempty words with a total of 2n letters over n-ary alphabet containing the n-th letter such that within each prefix of a word every letter of the alphabet is at least as frequent as the subsequent alphabet letter.
A293115
Number of sets of nonempty words with a total of 2n letters over n-ary alphabet containing the n-th letter 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) =8a(3) =53a(4) =410a(5) =3576a(6) =35878a(7) =391136a(8) =4666521a(9) =59096165a(10) =797628339a(11) =11282268353a(12) =167582833398
External references
- oeis: A293115