Number of growing tree trajectories (T(1),T(2),...,T(n)), where T(k) is an unlabeled tree on k nodes and T(k) can be obtained from T(k+1) by deletion of a leaf.
A268951
Number of growing tree trajectories (T(1),T(2),...,T(n)), where T(k) is an unlabeled tree on k nodes and T(k) can be obtained from T(k+1) by deletion of a leaf.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =2a(4) =4a(5) =13a(6) =48a(7) =235a(8) =1297a(9) =8628a(10) =63902a(11) =538454a(12) =4973090a(13) =50621738a(14) =557399709a(15) =6636723151a(16) =84584674076
External references
- oeis: A268951