A245897
Number of labeled increasing binary trees on 2n-1 nodes whose breadth-first reading word simultaneously avoids 231 and 321.
offset: 1
codomain: ℕ
The OEIS sequence has the tags “hard” and/or “more” and few known values. It is likely that the Lean code is not representing the actual sequence, even though it coincides in the known values.
Declarations
Section titled “Declarations”- A245897computable