The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A293889 Number of sets 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, 81, 554, 3723, 22795, 138112, 804518, 4666521, 26601027, 151607448, 858078020, 4867646261, 27569926921, 156731332711, 892188573587, 5101471557918, 29254697416411, 168575093334130, 975019430127356, 5667406033511452, 33079212453456235, 194029375272192986 (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) = A293747(n) - A293746(n). CROSSREFS Column k=8 of A293113. Cf. A293746, A293747. Sequence in context: A343462 A207009 A196986 * A218268 A223882 A267961 Adjacent sequences:  A293886 A293887 A293888 * A293890 A293891 A293892 KEYWORD nonn AUTHOR Alois P. Heinz, Oct 18 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 29 01:05 EST 2021. Contains 349415 sequences. (Running on oeis4.)