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!)
 A226889 Number of n-length words w over a 10-ary alphabet {a1,a2,...,a10} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a10) >= 1, where #(w,x) counts the letters x in word w. 2
 3628800, 19958400, 199584000, 1556755200, 14045391360, 116237721600, 1096301606400, 9944898163200, 98823235230720, 985768475852160, 10494386800934400, 88832292392188800, 848327839539586560, 7627235867290892160, 71992606401661397760, 656191923706230912000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 10,1 LINKS Alois P. Heinz, Table of n, a(n) for n = 10..1000 CROSSREFS Column k=10 of A226874. Sequence in context: A068158 A011521 A321846 * A284207 A061603 A153761 Adjacent sequences:  A226886 A226887 A226888 * A226890 A226891 A226892 KEYWORD nonn AUTHOR Alois P. Heinz, Jun 21 2013 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 September 26 20:34 EDT 2021. Contains 347672 sequences. (Running on oeis4.)