
About this episode
Explore A00098, the number of ways to partition n when each part size 1, 2, and 3 comes in two distinct kinds. We’ll walk through small examples (A3 = 10) and show how this sequence connects to partitions of odd numbers into three odd parts, including a convolution view with A00041 and A01399. We’ll also look at the main formulas: the generating function, a recursive formula, and an asymptotic expression that reveals its growth, highlighting why this simple counting setup leads to rich structure.
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