A212258 - OEIS

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

A212258

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

0, 0, 1, 6, 25, 105, 490, 2548, 14698, 93420, 649715, 4912776, 40154387, 352937312, 3320636540, 33305992320, 354819046132, 4001699525376, 47637151241125, 596958623741440, 7855611484697773, 108314507544748032, 1561635447992241230, 23498865431367684096

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

OFFSET

2,4

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: A029871 A188178 A147543 * A048875 A295202 A346894

Adjacent sequences: A212255 A212256 A212257 * A212259 A212260 A212261

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, May 11 2012

EXTENSIONS

More terms from Alois P. Heinz, Apr 03 2014

STATUS

approved