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

 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
 1, 10, 101, 762, 5644, 37759, 249346, 1575028, 9882928, 60748286, 372625221, 2265134302, 13781508870, 83609540368, 508633993673, 3095996847792, 18917973769416, 115888594051965, 713122785565957, 4404107814340191, 27330754066244314, 170323622877898732 (list; graph; refs; listen; history; text; internal format)
 OFFSET 9,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 9..1000 FORMULA a(n) = A293739(n) - A293738(n). CROSSREFS Column k=9 of A293109. Cf. A293738, A293739. Sequence in context: A077712 A219763 A214390 * A210167 A288790 A280371 Adjacent sequences:  A293801 A293802 A293803 * A293805 A293806 A293807 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 11 22:55 EDT 2022. Contains 356067 sequences. (Running on oeis4.)