login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
Danny W. et al., Counting growing tree trajectories, MathOverflow, 2016.
CROSSREFS
Sequence in context: A246494 A362642 A334444 * A290722 A341378 A058134
KEYWORD
nonn
AUTHOR
Max Alekseyev, Feb 16 2016
EXTENSIONS
Definition clarified by Brendan McKay, Feb 16 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 28 22:27 EST 2024. Contains 370400 sequences. (Running on oeis4.)