a(n) is the number of cycles of the permutation that converts forest(n) of depth-first planar planted binary trees into breadth-first representation.
A038775
a(n) is the number of cycles of the permutation that converts forest(n) of depth-first planar planted binary trees into breadth-first representation.
Terms
- a(0) =1a(1) =2a(2) =3a(3) =6a(4) =10a(5) =12a(6) =17a(7) =26a(8) =34a(9) =50a(10) =56a(11) =68a(12) =82a(13) =94a(14) =113
External references
- oeis: A038775