Number of ternary trees with n internal nodes labeled 1 or 2; nodes labeled 1 have three linearly ordered children, but nodes labeled 2 have three children which are reversible (the first and third children may be transposed but the middle child must remain in place).

A391194

Number of ternary trees with n internal nodes labeled 1 or 2; nodes labeled 1 have three linearly ordered children, but nodes labeled 2 have three children which are reversible (the first and third children may be transposed but the middle child must remain in place).

Terms

    a(0) =1a(1) =2a(2) =10a(3) =69a(4) =539a(5) =4582a(6) =41043a(7) =381871a(8) =3653619a(9) =35722529a(10) =355337667a(11) =3584596437a(12) =36585243851a(13) =377093026829

External references