scienceDec 27, 202418:48pending
OEIS A000084: Series-parallel networks with n edges
About this episode
Exploring A000084: the number of unlabeled series-parallel networks with n edges. We’ll see how this simple counting problem ties into circuit topology, co-graphs, P4-free graphs, and equivalent resistances. Join us as we trace the math from McMahon’s yoke chains through Riordan, Shannon, Foster, Cameron, and the OEIS itself, uncovering how one sequence threads through combinatorics, graph theory, and network design.
Note: This podcast was AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.
Sponsored by Embersilk LLC
Get every episode summarized
Each time Intellectually Curious publishes, we email you a written briefing from the transcript — the topics, who appeared, and any specific claims, with the ad reads skipped.
Email me new episodesFree for 3 shows. No card needed.
Hosts & guests
No transcript yet
This episode has not been transcribed. Request it and it moves to the front of the queue.
More episodes
More from Intellectually Curious
Free Pause Tokens Solve AI Multitasking
Intellectually Curious
Sep 14, 20266:39failed
Claude’s Autonomous Formalization of Fermat’s Last Theorem
Intellectually Curious
Sep 13, 20266:48completed
Random Attention: How AI Gets Faster by Forgetting
Intellectually Curious
Sep 12, 20266:13completed
The Alien Anatomy of the Bigfin Squid
Intellectually Curious
Sep 11, 20265:48completed