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!)
A211602 Number of binary increasing trees with n nodes and "min-path" of length 3. 3

%I #17 Nov 05 2020 05:30:36

%S 0,1,3,7,20,70,287,1356,7248

%N Number of binary increasing trees with n nodes and "min-path" of length 3.

%H Filippo Disanto, <a href="http://arxiv.org/abs/1202.1139">André permutations of the second kind associated to strictly binary increasing trees and left to right minima in their sub-permutations</a>, arXiv preprint arXiv:1202.1139 [math.CO], 2012-2014.

%Y A diagonal of A186366.

%K nonn,more

%O 2,3

%A _N. J. A. Sloane_, May 11 2012

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 April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)