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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A213872 Number of words w where each letter of the 10-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, 3628800, 654729075, 89575852312675, 140633739174235040170, 961415357313559098150122721, 18131599140232990157442722880124741, 725168149513389307543056971716033431701831, 51960277212541922189750307005207837858451630919380 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Table of n, a(n) for n=0..8. EXAMPLE a(0) = 1: the empty word. a(1) = 3628800: all permutations of 10 letters. CROSSREFS Column k=10 of A213275. Sequence in context: A133132 A228913 A179065 * A227672 A172540 A071552 Adjacent sequences: A213869 A213870 A213871 * A213873 A213874 A213875 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.

Last modified April 20 21:11 EDT 2024. Contains 371845 sequences. (Running on oeis4.)