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!)
A293798 Number of multisets of nonempty words with a total of n letters over ternary alphabet containing the third 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:32:15

%S 1,4,17,58,193,603,1852,5539,16391,47919,139258,402365,1159175,

%T 3330974,9561080,27421882,78642072,225566206,647308614,1858741431,

%U 5341591906,15363474607,44228744168,127444421304,367573522408,1061131077602,3066124030310,8867379519154

%N Number of multisets of nonempty words with a total of n letters over ternary alphabet containing the third 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="/A293798/b293798.txt">Table of n, a(n) for n = 3..1000</a>

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

%Y Column k=3 of A293109.

%Y Cf. A293732, A293733.

%K nonn

%O 3,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 04:13 EDT 2024. Contains 371235 sequences. (Running on oeis4.)