Number of n-length words w over ternary 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.
A213291
Number of n-length words w over ternary 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) =3a(2) =9a(3) =18a(4) =36a(5) =74a(6) =165a(7) =367a(8) =869a(9) =2074a(10) =5168a(11) =13026a(12) =33749a(13) =88368a(14) =235389a(15) =632324a(16) =1717202a(17) =4693604a(18) =12921864a(19) =35751336a(20) =99416633a(21) =277527448a(22) =777659128a(23) =2185854247a(24) =6162168724a(25) =17416305904a(26) =49342480077a(27) =140094014788a(28) =398558682310
External references
- oeis: A213291