Number of pairs of binary trees with n leaves which have only a single common parse word under the grammar G = {0 -> 12, 0 -> 21, 1 -> 02, 1 -> 20, 2 -> 01, 2 -> 10}.
A265279
Number of pairs of binary trees with n leaves which have only a single common parse word under the grammar G = {0 -> 12, 0 -> 21, 1 -> 02, 1 -> 20, 2 -> 01, 2 -> 10}.
Terms
- a(0) =1a(1) =5a(2) =30a(3) =196a(4) =1348a(5) =9603a(6) =70210a(7) =523732a(8) =3969948a(9) =30490434
External references
- oeis: A265279