_Antti Karttunen _, Jun 12 2002
_Antti Karttunen _, Jun 12 2002
This corresponds to Lisp/Scheme function 'cdr' computed with respect to the lexicographical ordering of parenthesizations/planar binary trees (A014486), i.e. with planar binary trees this is equal to extracting the right subtree (from the root), with general parenthesizations equal to discarding the first sub-parenthesization of the top-level list, and with general plane trees equal to discarding the leftmost branch from the root.
A. Karttunen, <A HREFa href="http://www.iki.fi/~kartturi/matikka/Nekomorphisms/gatomorf.htm">GatomorphismsAa> (with the complete Scheme source)
nonn,new
nonn
0, 1, 0, 2, 3, 1, 0, 0, 4, 5, 6, 7, 8, 2, 3, 1, 0, 0, 1, 0, 0, 0, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 4, 5, 6, 7, 8, 2, 3, 1, 0, 0, 1, 0, 0, 0, 2, 3, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44
1,4
This corresponds to Lisp/Scheme function 'cdr' computed with respect to the lexicographical ordering of parenthesizations/planar binary trees (A014486), i.e. with planar binary trees this is equal to extracting the right subtree (from the root), with general parenthesizations equal to discarding the first sub-parenthesization of the top-level list, and with general plane trees equal to discarding the leftmost branch from the root.
A. Karttunen, <A HREF="http://www.iki.fi/~kartturi/matikka/Nekomorphisms/gatomorf.htm">Gatomorphisms
nonn
Antti Karttunen Jun 12 2002
approved