A212259 - OEIS

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

A212259

Number of binary increasing trees with n nodes and "min-path" of length 5.

0, 0, 0, 1, 10, 65, 385, 2345, 15204, 105880, 793210, 6382860, 55020966, 506505272, 4963812035, 51629528080, 568303728360, 6602266433920, 80751432154868, 1037402030622720, 13968636570706370, 196748236140538368, 2893482720437769317, 44355269272024284160

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,5

LINKS

Table of n, a(n) for n=2..25.

Filippo Disanto, André permutations of the second kind associated to strictly binary increasing trees and left to right minima in their sub-permutations, arXiv preprint arXiv:1202.1139 [math.CO], 2012-2014.

CROSSREFS

A diagonal of A186366.

Sequence in context: A346895 A291231 A097791 * A198848 A215764 A262342

Adjacent sequences: A212256 A212257 A212258 * A212260 A212261 A212262

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, May 11 2012

EXTENSIONS

More terms from Alois P. Heinz, Apr 03 2014

STATUS

approved