login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A212259
Number of binary increasing trees with n nodes and "min-path" of length 5.
1
0, 0, 0, 1, 10, 65, 385, 2345, 15204, 105880, 793210, 6382860, 55020966, 506505272, 4963812035, 51629528080, 568303728360, 6602266433920, 80751432154868, 1037402030622720, 13968636570706370, 196748236140538368, 2893482720437769317, 44355269272024284160
OFFSET
2,5
CROSSREFS
A diagonal of A186366.
Sequence in context: A346895 A291231 A097791 * A198848 A215764 A262342
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, May 11 2012
EXTENSIONS
More terms from Alois P. Heinz, Apr 03 2014
STATUS
approved