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.

1, 1, 1, 2, 4, 13, 48, 235, 1297, 8628, 63902, 538454, 4973090, 50621738, 557399709, 6636723151, 84584674076, 1151419603932, 16640050320703, 254656634876886, 4110614617328251, 69818868005928116, 1244251510078579731, 23216586390303085622, 452567906988785409009

Offset

1,4

Links

Table of n, a(n) for n=1..25.

Danny W. et al., Counting growing tree trajectories, MathOverflow, 2016.

Crossrefs

Cf. A000055, A000081, A245246.

Sequence in context: A246494 A362642 A334444 * A290722 A341378 A384035

Adjacent sequences: A268948 A268949 A268950 * A268952 A268953 A268954

Keyword

nonn

Author

Max Alekseyev, Feb 16 2016

Extensions

Definition clarified by Brendan McKay, Feb 16 2016

Status

approved