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!)
A213869 Number of words w where each letter of the n-ary alphabet occurs 9 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, 6292, 846167608, 673174876488400, 1785201362960729511070, 11481253272835564584899247346, 146812609193179942830629976945746464, 3264601141014490309682718148875987514642243, 114752550881830601773639529476205016572641397025904 (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: aaaaaaaaa.

a(2) = 6292: aaaaaaaaabbbbbbbbb, aaaaaaaababbbbbbbb, ..., baababababababaabb, baabababababababab.

CROSSREFS

Row n=9 of A213275.

Sequence in context: A071091 A209826 A107582 * A350416 A189344 A054560

Adjacent sequences:  A213866 A213867 A213868 * A213870 A213871 A213872

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 June 28 18:26 EDT 2022. Contains 354907 sequences. (Running on oeis4.)