OEIS A00259: Number of rooted planar maps

A concise, intuition-first tour of OEIS A00259. We’ll connect the abstract world of rooted planar maps to an accessible lattice-path picture: count NE paths from (0,0) to (2n,n) that begin with a north step, end with an east step, and never bounce off the line y = x/2. We’ll trace the history from Brown’s 1963 enumeration to Wiener’s exact path-counting formula using Fibonacci numbers, and summarize Kosevich’s sharp asymptotics for large n. Along the way, you’ll see surprising links between maps, Fibonacci numbers, and fast-growing combinatorial sequences.

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

Sponsored by Embersilk LLC