cp's OEIS Frontend

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.

%I A293797 #5 Oct 16 2017 11:26:51
%S A293797 1,3,10,24,62,140,329,725,1631,3548,7820,16887,36767,79046,170799,
%T A293797 365883,786361,1679486,3594580,7656839,16331933,34705064,73810524,
%U A293797 156501393,332001987,702530049,1486995062,3140712201,6634309660,13988510961,29494808402,62091823865
%N 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.
%H A293797 Alois P. Heinz, <a href="/A293797/b293797.txt">Table of n, a(n) for n = 2..1000</a>
%F A293797 a(n) = A293732(n) - A000041(n).
%Y A293797 Column k=2 of A293109.
%Y A293797 Cf. A000041, A293732.
%K A293797 nonn
%O A293797 2,2
%A A293797 _Alois P. Heinz_, Oct 16 2017