Triangle T(n,m) (read as T(1,1); T(2,1), T(2,2); T(3,1), T(3,2), T(3,3);) Number of distinct non-recursive Catalan Automorphisms whose minimum clause-representation requires examination of n nodes in total, divided into m non-default clauses.
A089831
Triangle T(n,m) (read as T(1,1); T(2,1), T(2,2); T(3,1), T(3,2), T(3,3);) Number of distinct non-recursive Catalan Automorphisms whose minimum clause-representation requires examination of n nodes in total, divided into m non-default clauses.
Terms
- a(0) =1a(1) =10a(2) =0a(3) =115a(4) =10a(5) =0a(6) =1666a(7) =139a(8) =0a(9) =0a(10) =30198a(11) =2570a(12) =0a(13) =0a(14) =0a(15) =665148a(16) =47878a(17) =904a(18) =0a(19) =0a(20) =0a(21) =17296851a(22) =1017174a(23) =20972a(24) =0a(25) =0a(26) =0a(27) =0
External references
- oeis: A089831