A293797 - OEIS

A293797

Number of multisets of nonempty words with a total of n letters over binary alphabet containing the second 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, 3, 10, 24, 62, 140, 329, 725, 1631, 3548, 7820, 16887, 36767, 79046, 170799, 365883, 786361, 1679486, 3594580, 7656839, 16331933, 34705064, 73810524, 156501393, 332001987, 702530049, 1486995062, 3140712201, 6634309660, 13988510961, 29494808402, 62091823865

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,2

LINKS

Alois P. Heinz, Table of n, a(n) for n = 2..1000

FORMULA

a(n) = A293732(n) - A000041(n).

CROSSREFS

Column k=2 of A293109.

Cf. A000041, A293732.

Sequence in context: A338710 A336516 A286209 * A179608 A340686 A192912

Adjacent sequences: A293794 A293795 A293796 * A293798 A293799 A293800

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Oct 16 2017

STATUS

approved