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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

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
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, Andre' 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, 2012

CROSSREFS

A diagonal of A186366.

Sequence in context: A029871 A188178 A147543 * A048875 A295202 A094669

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

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 January 18 05:09 EST 2020. Contains 330995 sequences. (Running on oeis4.)