A089834 - OEIS

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

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”).

Other ways to Give

A089834

Number of distinct non-recursive Catalan bijections whose minimum clause-representation requires examination of n nodes in total and which require more than one non-default clause.

%I #4 Oct 17 2015 08:36:24

%S 0,0,10,139,2570,48782,1038146

%N Number of distinct non-recursive Catalan bijections whose minimum clause-representation requires examination of n nodes in total and which require more than one non-default clause.

%C Row sums of A089831 excluding the first column.

%Y a(n) = A089832(n)-A089833(n).

%K nonn

%O 1,3

%A _Antti Karttunen_, Dec 05 2003