AngouriMath

Navigation

← Back to list of members

#ctor​(AngouriMath.​Entity)

 Method (no overloads)

Summary

The Catalan number catalannumber(n), C_n = binomial(2n, n) / (n + 1): 1, 1, 2, 5,
14 from n = 0, the number of ways to bracket a product of n + 1 factors.

Remarks

Off the whole numbers it is 4^n Γ(n + 1/2) / (√π Γ(n + 2)), as Mathematica's
CatalanNumber and SymPy's catalan are: -1/2 at -1, 0 at
every whole number below it, and no value at a negative half-integer, a pole of Γ(n + 1/2).
https://github.com/asc-community/AngouriMath/issues/2182

























Angouri © 2019-2026 · Project's repo · Site's repo · Octicons · Transparency · 5629 pages online