Square array A(n>=0,k>=1) (listed antidiagonally: A(0,1)=1, A(1,1)=1, A(0,2)=1, A(2,1)=2, A(1,2)=1, A(0,3)=1, A(3,1)=3, ...) giving the number of n-edge general plane trees fixed by k-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
A079216
Square array A(n>=0,k>=1) (listed antidiagonally: A(0,1)=1, A(1,1)=1, A(0,2)=1, A(2,1)=2, A(1,2)=1, A(0,3)=1, A(3,1)=3, ...) giving the number of n-edge general plane trees fixed by k-fold application of Catalan Automorphisms A057511/A057512 (Deep rotation of general parenthesizations/plane trees).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =1a(5) =1a(6) =3a(7) =2a(8) =1a(9) =1a(10) =5a(11) =5a(12) =2a(13) =1a(14) =1a(15) =6a(16) =11a(17) =3a(18) =2a(19) =1a(20) =1a(21) =10a(22) =26a(23) =8a(24) =5a(25) =2a(26) =1a(27) =1a(28) =11a(29) =66
External references
- oeis: A079216