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

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A321845 Number of words w of length n such that each letter of the nonary alphabet is used at least once and for every prefix z of w we have #(z,a_i) = 0 or #(z,a_i) >= #(z,a_j) for all j>i and #(z,a_i) counts the occurrences of the i-th letter in z. 1
362880, 1814400, 11642400, 57879360, 302856840, 1452611160, 7181851950, 34386725520, 168206363745, 815113118385, 4018968988380, 19841370665865, 99477246363495, 502000638243720, 2569888903846460, 13275926076237132, 69519580918458790, 367795800026341605 (list; graph; refs; listen; history; text; internal format)
OFFSET

9,1

LINKS

Table of n, a(n) for n=9..26.

CROSSREFS

Column k=9 of A257783.

Sequence in context: A110453 A110452 A011520 * A226888 A284206 A179736

Adjacent sequences:  A321842 A321843 A321844 * A321846 A321847 A321848

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Nov 19 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 6 19:30 EST 2021. Contains 349567 sequences. (Running on oeis4.)