|
%I #5 Jun 15 2012 03:52:31
%S 1,5,25,95,315,895,2535,7280,21562,64924,201975,640915,2095019,
%T 6978713,23859310,82982260,295202798,1066467105,3928481530,
%U 14672457970,55722273963,214254166369,835669136725,3295598362466,13156401722237,53038076210255,216053087821059
%N 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.
%H Alois P. Heinz, <a href="/A213293/b213293.txt">Table of n, a(n) for n = 0..100</a>
%Y Column k=5 of A213276.
%K nonn
%O 0,2
%A _Alois P. Heinz_, Jun 08 2012
|
