T(n,k) counts ordered complete ternary trees with 2*n-1 leaves having k internal vertices colored black, the remaining n-1-k internal vertices colored white, and such that each vertex and its rightmost child have different colors.
A196201
T(n,k) counts ordered complete ternary trees with 2*n-1 leaves having k internal vertices colored black, the remaining n-1-k internal vertices colored white, and such that each vertex and its rightmost child have different colors.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =6a(5) =2a(6) =5a(7) =28a(8) =28a(9) =5a(10) =14a(11) =120a(12) =230a(13) =120a(14) =14a(15) =27a(16) =326a(17) =985a(18) =985a(19) =326a(20) =27a(21) =56a(22) =877a(23) =3701a(24) =5848a(25) =3701a(26) =877a(27) =56a(28) =116a(29) =2212
External references
- oeis: A196201