A082861 -id:A082861 - cp's OEIS frontend

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

Antti Karttunen, May 06 2003

Note that together with A082858 this forms a distributive lattice, thus it is possible to compute this function also with the binary OR-operation (A003986) with the help of appropriate mapping functions. I.e. we have A(x,y) = A082857(A003986(A082856(x), A082856(y))).

Antti Karttunen, Alternative Catalan Orderings (with the complete Scheme source)
Index entries for sequences related to lattices

The lower/upper triangular region: A082861. Cf. A072764, A080300, A025581, A002262.

A082859 Lower triangular region of A082858.

Original entry on oeis.org

0, 0, 1, 0, 1, 2, 0, 1, 1, 3, 0, 1, 2, 1, 4, 0, 1, 2, 1, 2, 5, 0, 1, 2, 3, 2, 2, 6, 0, 1, 1, 3, 1, 1, 3, 7, 0, 1, 1, 3, 1, 1, 3, 3, 8, 0, 1, 2, 1, 4, 2, 2, 1, 1, 9, 0, 1, 2, 1, 4, 2, 2, 1, 1, 4, 10, 0, 1, 2, 1, 4, 5, 2, 1, 1, 4, 4, 11, 0, 1, 2, 1, 2, 5, 2, 1, 1, 2, 2, 5, 12, 0, 1, 2, 1, 2, 5, 2, 1, 1, 2, 2, 5, 5, 13, 0, 1, 2, 3, 4, 2, 6, 3, 3, 4, 4, 4, 2, 2, 14

Offset: 0

Antti Karttunen, May 06 2003

Antti Karttunen, Alternative Catalan Orderings (with the complete Scheme source)

Cf. A082861, A003056, A002262.

cp's OEIS Frontend

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).

Views

Author

Keywords

Comments

Links