cp's OEIS Frontend

A293889 Number of sets of nonempty words with a total of n letters over octonary alphabet containing the eighth 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 A293889 #4 Oct 18 2017 19:07:35
%S A293889 1,9,81,554,3723,22795,138112,804518,4666521,26601027,151607448,
%T A293889 858078020,4867646261,27569926921,156731332711,892188573587,
%U A293889 5101471557918,29254697416411,168575093334130,975019430127356,5667406033511452,33079212453456235,194029375272192986
%N A293889 Number of sets of nonempty words with a total of n letters over octonary alphabet containing the eighth 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 A293889 Alois P. Heinz, <a href="/A293889/b293889.txt">Table of n, a(n) for n = 8..1000</a>
%F A293889 a(n) = A293747(n) - A293746(n).
%Y A293889 Column k=8 of A293113.
%Y A293889 Cf. A293746, A293747.
%K A293889 nonn
%O A293889 8,2
%A A293889 _Alois P. Heinz_, Oct 18 2017