Number of n-length words w over binary 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.
A213290
Number of n-length words w over binary 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) =1a(1) =2a(2) =4a(3) =5a(4) =9a(5) =14a(6) =27a(7) =46a(8) =91a(9) =162a(10) =323a(11) =589a(12) =1177a(13) =2179a(14) =4357a(15) =8152a(16) =16303a(17) =30746a(18) =61491a(19) =116689a(20) =233377a(21) =445095a(22) =890189a(23) =1704795a(24) =3409589a(25) =6552379a(26) =13104757a(27) =25258601a(28) =50517201a(29) =97617061
External references
- oeis: A213290