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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A293805 Number of multisets 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, 122, 1003, 8072, 58393, 415813, 2822727, 18990467, 124845136, 817467196, 5294723066, 34272624834, 220905232624, 1426144152942, 9203001308101, 59568878313749, 386275420910370, 2514732764176094, 16423245577572038, 107740652646320926, 709605496053325546 (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) = A293740(n) - A293739(n). CROSSREFS Column k=10 of A293109. Cf. A293739, A293740. Sequence in context: A110398 A176595 A067218 * A288791 A049666 A163462 Adjacent sequences:  A293802 A293803 A293804 * A293806 A293807 A293808 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 June 28 07:25 EDT 2022. Contains 354903 sequences. (Running on oeis4.)