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!)
A293804 Number of multisets of nonempty words with a total of n letters over nonary alphabet containing the ninth 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

%S 1,10,101,762,5644,37759,249346,1575028,9882928,60748286,372625221,

%T 2265134302,13781508870,83609540368,508633993673,3095996847792,

%U 18917973769416,115888594051965,713122785565957,4404107814340191,27330754066244314,170323622877898732

%N Number of multisets of nonempty words with a total of n letters over nonary alphabet containing the ninth 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="/A293804/b293804.txt">Table of n, a(n) for n = 9..1000</a>

%F a(n) = A293739(n) - A293738(n).

%Y Column k=9 of A293109.

%Y Cf. A293738, A293739.

%K nonn

%O 9,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 September 25 09:46 EDT 2022. Contains 356977 sequences. (Running on oeis4.)