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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A213871 Number of words w where each letter of the 9-ary alphabet occurs n times 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
1, 362880, 34459425, 1035588754375, 256653852463806955, 224909472938181653263446, 468682891926540940991787213006, 1850042480471503379038420801262526759, 11963401430840044468894095677711389363239184, 114752550881830601773639529476205016572641397025904 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

EXAMPLE

a(0) = 1: the empty word.

a(1) = 362880: all permutations of 9 letters.

CROSSREFS

Column k=9 of A213275.

Sequence in context: A133360 A254082 A228912 * A179064 A246197 A246617

Adjacent sequences:  A213868 A213869 A213870 * A213872 A213873 A213874

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Jun 23 2012

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 25 12:34 EDT 2022. Contains 354071 sequences. (Running on oeis4.)