A213293 Number of n-length words w over 5-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, 5, 25, 95, 315, 895, 2535, 7280, 21562, 64924, 201975, 640915, 2095019, 6978713, 23859310, 82982260, 295202798, 1066467105, 3928481530, 14672457970, 55722273963, 214254166369, 835669136725, 3295598362466, 13156401722237, 53038076210255, 216053087821059

Offset

0,2

Links

Alois P. Heinz, Table of n, a(n) for n = 0..100

Crossrefs

Column k=5 of A213276.

Sequence in context: A134140 A225011 A228457 * A203184 A073374 A126878

Adjacent sequences: A213290 A213291 A213292 * A213294 A213295 A213296

Keyword

nonn

Author

Alois P. Heinz, Jun 08 2012

Status

approved