Recurrence behind the list

Fibonacci numbers start with F0=0F_0 = 0 and F1=1F_1 = 1, then each new term is the sum of the previous two.

That recurrence Fn=Fn1+Fn2F_n = F_{n-1} + F_{n-2} produces the familiar sequence 0,1,1,2,3,5,8,dots0,1,1,2,3,5,8,dots.

The first-screen cards help you see the rapid growth instead of only reading a block of text output.

Why people study it

  • Recurrence relations and introductory proof practice.
  • Algorithm exercises involving dynamic programming and memoization.
  • Pattern exploration connected to growth, ratios, and the golden ratio.