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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A293886 Number of sets 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, 36, 172, 813, 3576, 15647, 66493, 282063, 1181554, 4951592, 20648077, 86254964, 359920291, 1505749933, 6305449303, 26485669295, 111485395542, 470834817242, 1993891398761, 8472782274541, 36113575773694, 154458283438023, 662716935400473, 2853093892389838 (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) = A293744(n) - A293743(n). CROSSREFS Column k=5 of A293113. Cf. A293743, A293744. Sequence in context: A190065 A293068 A213294 * A132165 A200573 A224130 Adjacent sequences:  A293883 A293884 A293885 * A293887 A293888 A293889 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 May 25 06:43 EDT 2022. Contains 354049 sequences. (Running on oeis4.)