Number of 10-length words w over n-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.
A213289
Number of 10-length words w over n-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.
Terms
- a(0) =0a(1) =1a(2) =323a(3) =5168a(4) =37993a(5) =201975a(6) =916966a(7) =3771418a(8) =14486158a(9) =52359693a(10) =178880725a(11) =575581556a(12) =1731294863a(13) =4845394723a(14) =12619979568a(15) =30703918750a(16) =70168864396a(17) =151545355033a(18) =311129635863a(19) =610492421368
External references
- oeis: A213289