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!)
A213298 Number of n-length words w over 10-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, 10, 100, 865, 6805, 47590, 297595, 1662160, 8418649, 39598078, 178880725, 795246055, 3519278713, 15573399301, 69314501935, 311040898945, 1411268823196, 6478030875460, 30129403442530, 141971859499360, 678365095896001, 3285531463054108, 16137537771997720 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

CROSSREFS

Column k=10 of A213276.

Sequence in context: A293890 A218269 A224348 * A224007 A136876 A231157

Adjacent sequences:  A213295 A213296 A213297 * A213299 A213300 A213301

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 26 07:19 EST 2022. Contains 350573 sequences. (Running on oeis4.)