About this episode
We count non-isomorphic trees with diameter exactly 6. Starting at seven vertices, the sequence shows how many distinct trees exist for n vertices, with terms that grow rapidly as you add vertices. The OEIS page reveals history (formerly M2887N1158, N1158) and the offset 7,2, plus how terms are generated via generating-function techniques like the shifted Euler transform and Piri code. It also connects to Riordan’s foundational work on counting trees by height and diameter, offers cross-references to related diameter sequences, and notes ongoing computation (Seavers, Irvine) that keeps OEIS a living resource.
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
Did OpenAI Solve Navier-Stokes? A Future-Shaping Claim Put to the Test
Intellectually Curious
Sep 9, 20265:52failed
Understanding the Hubble Tension
Intellectually Curious
Sep 9, 20265:57failed
OpenClaw 2.0 Feature Overview
Intellectually Curious
Sep 8, 20268:03failed
First to Leave, Last to Arrive: The $15 Million Fermi Explorer to Alpha Centauri
Intellectually Curious
Sep 7, 20265:50failed