TECHNOLOGEPH

The fibonacci sequence is a series of numbers where each number is found by adding the two previous numbers. The first 7 numbers in the sequence are 0, 1, 1, 2, 3, 5, 8.

Have the students, using recursion, write a program that finds the nth fibonacci number in the sequence.

Using the turtle module, have the students create a recursive function to draw concentric circles like the ones below.

Have the students recursively check to see if a word is a palindrome.