login
This site is supported by donations 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

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: A184177 A005164 A246494 * A290722 A058134 A246012

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

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 18 14:37 EST 2019. Contains 329262 sequences. (Running on oeis4.)