Function that converts arabic numbers to roman numbers using TDD.
Let's consider the followinginfinite sequence: 0,1,1,2,3,5,8,13,12,7,10,8,9,... write a function that given an integer N returns the Nth element of the sequence. Each of the elements is the sum of the separate digits of the two previous elements.
