Fibonacci with TI Basic

If you want to calculate the first few numbers in the Fibonacci sequence:

: { 1, 1 } -> L1
: 2 -> A
: While 1
: A + 1 -> A
: L1( A - 2 ) + L1( A - 1 ) -> L1
: End

You will end up with L1, a list of the first few Fibonacci numbers up to nearly 10¹⁰⁰, where overflow will occur. If you want to print the numbers too, just add this in the while loop (second last line):

: Disp L1( A )

Maybe Related?

• Project Euler 2: Sum of Even Fibonacci Numbers
• Calculate the Fibonacci Sequence with Perl
• A Filled Circle in TI Basic
• Galactic Battlegrounds is NOT an Age of Kings rip-off
• HTS Basic Web 9: Directory Transversal