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!)
A293803 Number of multisets 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. 2

%I #4 Oct 16 2017 11:58:19

%S 1,9,82,563,3807,23376,142085,829038,4816390,27477989,156716051,

%T 887263747,5034299169,28513927121,162089445027,922536360293,

%U 5273968531519,30236181831043,174184141284927,1007162425272715,5852489042303046,34148843838375080,200241641820235902

%N Number of multisets 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 Alois P. Heinz, <a href="/A293803/b293803.txt">Table of n, a(n) for n = 8..1000</a>

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

%Y Column k=8 of A293109.

%Y Cf. A293737, A293738.

%K nonn

%O 8,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 March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)