login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A212258 Number of binary increasing trees with n nodes and "min-path" of length 4. 1

%I

%S 0,0,1,6,25,105,490,2548,14698,93420,649715,4912776,40154387,

%T 352937312,3320636540,33305992320,354819046132,4001699525376,

%U 47637151241125,596958623741440,7855611484697773,108314507544748032,1561635447992241230,23498865431367684096

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

%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

%O 2,4

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

%E More terms from _Alois P. Heinz_, Apr 03 2014

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 October 20 02:21 EDT 2021. Contains 348099 sequences. (Running on oeis4.)