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

 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
 1, 9, 82, 563, 3807, 23376, 142085, 829038, 4816390, 27477989, 156716051, 887263747, 5034299169, 28513927121, 162089445027, 922536360293, 5273968531519, 30236181831043, 174184141284927, 1007162425272715, 5852489042303046, 34148843838375080, 200241641820235902 (list; graph; refs; listen; history; text; internal format)
 OFFSET 8,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 8..1000 FORMULA a(n) = A293738(n) - A293737(n). CROSSREFS Column k=8 of A293109. Cf. A293737, A293738. Sequence in context: A263816 A345143 A275917 * A263817 A288789 A033119 Adjacent sequences:  A293800 A293801 A293802 * A293804 A293805 A293806 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 August 12 00:34 EDT 2022. Contains 356067 sequences. (Running on oeis4.)