Recursively Defined Sequence in TI84

How to use your calculator to find the terms of a sequence that is defined recursively

[@donniesquirts5131]

You're a lifesaver thank you

[@RevHouse24]

Nice video

[@mbinfamous8219]

What do I do if I have several initial values? My a(n-1) = 1, a(n-2)= 2, etc

[@Anonymous594]

Be quiet

[@adrienanderson7439]

You have probably figured it out by now but for other people, instead of putting just one number in the field u(nMin) you give it multiple values in curly braces like this, u(nMin)={1,0}, for these parameters u(n-1)=1 and u(n-2)=0. So you could do something like, u(n)=u(n-1)+u(n-2) and u(nMin)={1,1}, which would be the Fibonacci sequence.

[@adityadatta8443]

Hello! can you help me, How to enter the Fibonacci number please?

[@rimuruforlife9130]

is that a app your using or like a website is it ok if you link it for me thx i really need it loll