login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 2

%I #4 Oct 18 2017 19:14:47

%S 1,6,36,172,813,3576,15647,66493,282063,1181554,4951592,20648077,

%T 86254964,359920291,1505749933,6305449303,26485669295,111485395542,

%U 470834817242,1993891398761,8472782274541,36113575773694,154458283438023,662716935400473,2853093892389838

%N 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 Alois P. Heinz, <a href="/A293886/b293886.txt">Table of n, a(n) for n = 5..1000</a>

%F a(n) = A293744(n) - A293743(n).

%Y Column k=5 of A293113.

%Y Cf. A293743, A293744.

%K nonn

%O 5,2

%A _Alois P. Heinz_, Oct 18 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)