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!)
A213868 Number of words w where each letter of the n-ary alphabet occurs 8 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, 1859, 48349015, 5795673908453, 1953740543358042205, 1409438188685787895321841, 1835364055105945091130559202709, 3847028733161627562733350467148495403, 11963401430840044468894095677711389363239184, 51960277212541922189750307005207837858451630919380 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

LINKS

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

EXAMPLE

a(0) = 1: the empty word.

a(1) = 1: aaaaaaaa.

a(2) = 1859: aaaaaaaabbbbbbbb, aaaaaaababbbbbbb, ..., baabababababaabb, baababababababab.

CROSSREFS

Row n=8 of A213275.

Sequence in context: A202913 A159212 A120809 * A022062 A107526 A132202

Adjacent sequences:  A213865 A213866 A213867 * A213869 A213870 A213871

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 July 1 04:13 EDT 2022. Contains 354951 sequences. (Running on oeis4.)