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!)
A293799 Number of multisets of nonempty words with a total of n letters over quaternary alphabet containing the fourth 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 16 2017 11:36:52

%S 1,5,26,107,439,1663,6283,22912,83507,298936,1071564,3804461,13542785,

%T 47964338,170456957,604293910,2150604057,7647190962,27302834888,

%U 97491596984,349544018586,1254140950775,4517792721381,16291580640312,58974333255158,213744923737227

%N Number of multisets of nonempty words with a total of n letters over quaternary alphabet containing the fourth 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="/A293799/b293799.txt">Table of n, a(n) for n = 4..1000</a>

%F a(n) = A293734(n) - A293733(n).

%Y Column k=4 of A293109.

%Y Cf. A293733, A293734.

%K nonn

%O 4,2

%A _Alois P. Heinz_, Oct 16 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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)