Signature permutations of non-recursive Catalan automorphisms (i.e., bijections of finite plane binary trees, with no unlimited recursion down to indefinite distances from the root), sorted according to the minimum number of opening nodes needed in their defining clauses.

A089840

Signature permutations of non-recursive Catalan automorphisms (i.e., bijections of finite plane binary trees, with no unlimited recursion down to indefinite distances from the root), sorted according to the minimum number of opening nodes needed in their defining clauses.

Terms

    a(0) =0a(1) =1a(2) =0a(3) =2a(4) =1a(5) =0a(6) =3a(7) =3a(8) =1a(9) =0a(10) =4a(11) =2a(12) =2a(13) =1a(14) =0a(15) =5a(16) =7a(17) =3a(18) =2a(19) =1a(20) =0a(21) =6a(22) =8a(23) =4a(24) =3a(25) =2a(26) =1a(27) =0a(28) =7a(29) =6

External references