OEIS A000202: Floor(13n/8) with a recursive seed and Fibonacci connections

In this episode we unpack A000202: a sequence defined from its first eight terms by the recurrence a_{i+j} = 13i + a_j, which yields the closed form a_n = floor(13n/8). We explore how such a simple rule builds an integer sequence, its linear recurrence signature, and a surprising link to Fibonacci numbers. We also touch on historical context (Sloan's Handbook, Fibonacci Quarterly), how it differs from nearby sequences (A000201, A066096), and how to compute terms with Maple or Mathematica.

Note: This podcast was AI-generated, and sometimes AI can make mistakes. Please double-check any critical information.

Sponsored by Embersilk LLC