A082860 Array A(x,y): the least common supertree (union) of the binary trees x and y, (x,y) running as (0,0),(1,0),(0,1),(2,0),(1,1),(0,2) and each index referring to a binary tree encoded by A014486(j).
0, 1, 1, 2, 1, 2, 3, 2, 2, 3, 4, 3, 2, 3, 4, 5, 4, 6, 6, 4, 5, 6, 5, 4, 3, 4, 5, 6, 7, 6, 5, 14, 14, 5, 6, 7, 8, 7, 6, 15, 4, 15, 6, 7, 8, 9, 8, 16, 6, 11, 11, 6, 16, 8, 9, 10, 9, 19, 7, 14, 5, 14, 7, 19, 9, 10, 11, 10, 9, 8, 42, 15, 15, 42, 8, 9, 10, 11, 12, 11, 10, 37, 51, 43, 6, 43, 51, 37, 10, 11, 12, 13, 12, 11, 38, 9, 52, 16, 16, 52, 9, 38, 11, 12, 13, 14, 13, 12
Offset: 0
Links
- Antti Karttunen, Alternative Catalan Orderings (with the complete Scheme source)
- Index entries for sequences related to lattices
Comments