OEIS A000350: Fibonacci numbers ending with their index in a base
About this episode
We dive into A000350, the Fibonacci-ending-in-M problem across bases. In base 10, there are many nontrivial M, suggesting rich, infinite variation. In binary, the situation collapses: only M = 0, 1, 5 work—a result finally proven by Max Alexei after extensive computation (up to M < 2^25). We trace the history back to mid-1960s Fibonacci Quarterly work and pose questions about other bases like base 3 or base 8, illustrating how changing the base reshapes the underlying number-theoretic landscape.
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
Claude’s Autonomous Formalization of Fermat’s Last Theorem
Intellectually Curious
Random Attention: How AI Gets Faster by Forgetting
Intellectually Curious
The Alien Anatomy of the Bigfin Squid
Intellectually Curious
Beyond the Mouse: How AI Agents Learned to Use Computers
Intellectually Curious