TOPICS
Search

Segner's Recurrence Formula

The recurrence relation

E_n=E_2E_(n-1)+E_3E_(n-2)+...+E_(n-1)E_2

which gives the solution to Euler's polygon division problem.

See also

Catalan Number, Euler's Polygon Division Problem

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Segner's Recurrence Formula." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/SegnersRecurrenceFormula.html

Subject classifications