cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A211602 #17 Nov 05 2020 05:30:36
%S A211602 0,1,3,7,20,70,287,1356,7248
%N A211602 Number of binary increasing trees with n nodes and "min-path" of length 3.
%H A211602 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 A211602 A diagonal of A186366.
%K A211602 nonn,more
%O A211602 2,3
%A A211602 _N. J. A. Sloane_, May 11 2012