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!)
 A293800 Number of multisets of nonempty words with a total of n letters over quinary alphabet containing the fifth 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, 6, 37, 178, 852, 3767, 16576, 70635, 300433, 1260163, 5287178, 22058377, 92181691, 384663989, 1609206870, 6737170404, 28291573975, 119043337521, 502559706310, 2127305239457, 9035671605064, 38494638887783, 164564824326835, 705742561369640, 3036895648331815 (list; graph; refs; listen; history; text; internal format)
 OFFSET 5,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 5..1000 FORMULA a(n) = A293735(n) - A293734(n). CROSSREFS Column k=5 of A293109. Cf. A293734, A293735. Sequence in context: A047670 A338708 A129552 * A327611 A056338 A056328 Adjacent sequences:  A293797 A293798 A293799 * A293801 A293802 A293803 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 13 05:02 EDT 2021. Contains 343836 sequences. (Running on oeis4.)