
About this episode
We explore A000288, the tetranacci-type sequence with starting values 1,1,1,1. Its simple recurrence a(n)=a(n−1)+a(n−2)+a(n−3)+a(n−4) leads to surprising structure: a combinatorial interpretation counting 4-letter words over {0,1,2,3} with the rule that each 1, 2, or 3 must be followed by at least one, two, or three zeros respectively; it also exhibits Benford-like leading-digit distribution and grows with the tetranacci constant around 1.92756. We’ll also touch on its generating function and what these properties reveal about the richness lurking in simple recurrences.
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