OEIS A00096: The annulus-cutting sequence

We explore A00096, the quadratic a(n) = n(n+3)/2, and how a simple formula shows up in geometry, combinatorics, and CS. From maximizing pieces of a donut with n cuts to counting diagonals, prime polyominoes, chess endgames, and patterns in Pascal’s triangle and rooted trees, this episode reveals the surprising connections tucked inside one humble sequence.

Note:  This podcast was AI-generated, and sometimes AI can make mistakes.  Please double-check any critical information.

Sponsored by Embersilk LLC