30 3 raise to -comething 1+3 , 9, 27 ..... obs . x 3 prom previous , powers OF 3. OF = an = 3n - 1 1+1, 2:3 5, 813, 21. - Fibonacci Sequence obst. Add the previous two , set the First two terms to be ! 7: none for now Always include setting iF/ something about the given ca Fibonaci golden ration sequence ( greek p ) determined by a win 2 golden ration 2 +7 4 6bc : th . n = # of levels , draw the small triangles, count the OF small triangles And odd numbers in increasing manner eamitie - put association numbers m: slightly difficult OF: anen 1 141 9, 141 25,..... perfect squareMath in the modern World consider these , ( by 2 's ) - 2 , 4 , 6 8 10 12 0 7 sequences 12 x 3 ) - 1 , 3 , 9, 17, 41 patterns , ordering , rules ( add last - 1 1 + 2 + 3 , 5 + 8 13 , 21 two numbers ) - the pattern continues Recurrence veration - allows us to get the next (RR ) term depending on the previous team (s) 7, 4, 418, 10, 12 - 25th term = 50 32 + 25 general Formula- get the end term depending only on its (GP ) Warning: LR or GF may not exist * observation about the sequence (IF The Reor GF may not exist ) 2+ 4+ 41 8, 10 ... observations : Even numbers, - 2 prom the previous r = ananth term 30 = Bothterm a = ist term vil go. . a za