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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A293891 Number of sets of nonempty words with a total of n letters over denary alphabet containing the tenth 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, 11, 121, 992, 7948, 57368, 407495, 2762306, 18558261, 121903562, 797628339, 5164110575, 33416303576, 215354872472, 1390196456927, 8971242266557, 58072455010621, 376619368091666, 2452238779936085, 16018094650161058, 105103750467074777, 692390137170794830 (list; graph; refs; listen; history; text; internal format)
 OFFSET 10,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 10..1000 FORMULA a(n) = A293749(n) - A293748(n). CROSSREFS Column k=10 of A293113. Cf. A293748, A293749. Sequence in context: A223616 A223665 A068179 * A218262 A006940 A070844 Adjacent sequences:  A293888 A293889 A293890 * A293892 A293893 A293894 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 3 16:16 EDT 2022. Contains 355055 sequences. (Running on oeis4.)