login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A226888 Number of n-length words w over a 9-ary alphabet {a1,a2,...,a9} such that #(w,a1) >= #(w,a2) >= ... >= #(w,a9) >= 1, where #(w,x) counts the letters x in word w. 2
362880, 1814400, 16632000, 119750400, 1003242240, 7749181440, 68518850400, 584994009600, 5490179735040, 51882551360640, 405925296678720, 3438148872412800, 28858842800988480, 242180235433825920, 2068546823359410240, 17716539920908308480, 155272065377761886400 (list; graph; refs; listen; history; text; internal format)
OFFSET

9,1

LINKS

Alois P. Heinz, Table of n, a(n) for n = 9..1000

CROSSREFS

Column k=9 of A226874.

Sequence in context: A110452 A011520 A321845 * A284206 A179736 A045511

Adjacent sequences:  A226885 A226886 A226887 * A226889 A226890 A226891

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 20 06:06 EST 2018. Contains 317385 sequences. (Running on oeis4.)