|
|
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.
|
|
0
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|