Question: Find a recurrence relation for S n , the number of ways to writhe n as an ordered sum using only the number 1 ,

Find a recurrence relation for Sn, the number of ways to writhe n as an ordered sum using only the number 1 , and 2. for example, S4= 5 since 4 is equal to each of the followings: 1+1+1+1, 1+1+2, 1+2+1, 2+1+1, 2+2

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!