OFFSET
0,3
COMMENTS
Catalan recursion is:
a[0] = 1; a[n_] := a[n] = ((4*n - 2)/(n + 1))*a[n - 1];
The object here is to get a sequence that is Catalan like, but lower ( bifurcates higher).
FORMULA
a(n)=If[IntegerQ[((6*n - 4)/( n + 1))*a(n - 1)], ((6*n - 4)/(n + 1))* a(n - 1),
If[IntegerQ[((4*n - 2)/(n + 1))*a( n - 1)], ((4*n - 2)/(n + 1))*a(n - 1), n*a(n - 1)]]
MATHEMATICA
Clear [a, n]; a[0] = 1;
a[n_] := a[n] = If[IntegerQ[((6*n - 4)/(n + 1))*a[n - 1]], ((3*n - 2)/(n + 1))* a[n - 1],
If[IntegerQ[((6*n - 4)/(n + 1))*a[n - 1]], ((4*n - 2)/(n + 1))*a[n - 1], n*a[n - 1]]];
Table[a[n], {n, 0, 30}]
CROSSREFS
KEYWORD
nonn,uned
AUTHOR
Roger L. Bagula, Jan 24 2009
STATUS
approved