cp's OEIS Frontend

A293886 Number of sets of nonempty words with a total of n letters over quinary alphabet containing the fifth 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 A293886 #4 Oct 18 2017 19:14:47
%S A293886 1,6,36,172,813,3576,15647,66493,282063,1181554,4951592,20648077,
%T A293886 86254964,359920291,1505749933,6305449303,26485669295,111485395542,
%U A293886 470834817242,1993891398761,8472782274541,36113575773694,154458283438023,662716935400473,2853093892389838
%N A293886 Number of sets of nonempty words with a total of n letters over quinary alphabet containing the fifth 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 A293886 Alois P. Heinz, <a href="/A293886/b293886.txt">Table of n, a(n) for n = 5..1000</a>
%F A293886 a(n) = A293744(n) - A293743(n).
%Y A293886 Column k=5 of A293113.
%Y A293886 Cf. A293743, A293744.
%K A293886 nonn
%O A293886 5,2
%A A293886 _Alois P. Heinz_, Oct 18 2017