The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A213870 Number of words w where each letter of the n-ary alphabet occurs 10 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, 1, 21658, 15456538890, 84386541996407430, 1831976833971352074708780, 109898940874611419792791074271620, 14506158303190746913523011613729321067580, 3612014977093890544877702499165438785779326595871, 1520262998870097218529031803141231246364682853428845871416 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Table of n, a(n) for n=0..9. EXAMPLE a(0) = 1: the empty word. a(1) = 1: aaaaaaaaaa. a(2) = 21658: aaaaaaaaaabbbbbbbbbb, aaaaaaaaababbbbbbbbb, ..., baabababababababaabb, baababababababababab. CROSSREFS Row n=10 of A213275. Sequence in context: A037160 A271021 A262818 * A247694 A309964 A235219 Adjacent sequences: A213867 A213868 A213869 * A213871 A213872 A213873 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 May 28 15:54 EDT 2024. Contains 372916 sequences. (Running on oeis4.)