A293111 Number of multisets 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.

1, 2, 10, 58, 439, 3767, 37481, 405672, 4816390, 60748286, 817467196, 11533898929, 170979909037, 2635984019533, 42297026556483, 701880878089205, 12045976560853148, 212911592290588547, 3874514946593004395, 72378921228197309169, 1387364840045160600103

Offset

0,2

Links

Alois P. Heinz, Table of n, a(n) for n = 0..26

Formula

a(n) = A293109(2n,n).

Crossrefs

Cf. A182172, A293109, A293115.

Sequence in context: A074608 A086871 A108450 * A112369 A218944 A124964

Adjacent sequences: A293108 A293109 A293110 * A293112 A293113 A293114

Keyword

nonn

Author

Alois P. Heinz, Sep 30 2017

Status

approved