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!)
A213296 Number of n-length words w over 8-ary alphabet such that 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, 8, 64, 428, 2556, 13224, 60600, 250062, 977026, 3754472, 14486158, 56109736, 220213038, 875120922, 3539254104, 14534439529, 60794185555, 258385808222, 1118113946883, 4915589687030, 21983704654711, 99825770573061, 460645444681024, 2156595097630195 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

CROSSREFS

Column k=8 of A213276.

Sequence in context: A283859 A222446 A239034 * A223564 A146885 A122093

Adjacent sequences:  A213293 A213294 A213295 * A213297 A213298 A213299

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Jun 08 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 21:46 EST 2022. Contains 350472 sequences. (Running on oeis4.)