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

 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
 1, 4, 17, 58, 193, 603, 1852, 5539, 16391, 47919, 139258, 402365, 1159175, 3330974, 9561080, 27421882, 78642072, 225566206, 647308614, 1858741431, 5341591906, 15363474607, 44228744168, 127444421304, 367573522408, 1061131077602, 3066124030310, 8867379519154 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 3..1000 FORMULA a(n) = A293733(n) - A293732(n). CROSSREFS Column k=3 of A293109. Cf. A293732, A293733. Sequence in context: A317757 A183924 A255271 * A027075 A202974 A034331 Adjacent sequences: A293795 A293796 A293797 * A293799 A293800 A293801 KEYWORD nonn AUTHOR Alois P. Heinz, Oct 16 2017 STATUS approved

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.

Last modified July 13 08:08 EDT 2024. Contains 374274 sequences. (Running on oeis4.)