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
Fler avsnitt av Intellectually Curious
Visa alla avsnitt av Intellectually CuriousIntellectually Curious med Mike Breault finns tillgänglig på flera plattformar. Informationen på denna sida kommer från offentliga podd-flöden.
