This program gives a graphical and numerical representation of recursively-defined sequences. 1,2,3…n is stored to L1, while A[sub](k+1) as a function of A[sub]k is stored to L2. The sequence is plotted against its term number (in a graph situation), though reading off L2 for the sequence is more handy (especially for busy-work). The graphs are interesting, however; the graph of A[sub](k+1)=3A[sub]k, for example, increases like a geometric sequence with a common ratio r=3.
|Requirements:||Requires the ti-83 plus or a ti-84 model.|
(Click here for an explanation)
|Brief Description:||TI-84 Plus and TI-83 Plus graphing calculator program gives a graphical and numerical representation of recursive sequences.|
|Keywords:||Program, Calculus, ti-83 Plus, ti-84 Plus C SE, ti-84 Plus SE, ti-84 Plus, Calculator, Recursive, Sequences|