183k views
4 votes
Find a recurrence relation for the number of sequences of 1s, 3s, and 5s whose terms sum to n. (b) Repeat part (a) with the added condition that no 5 can be followed by a 1. (c) Repeat part (a) with the condition of no subsequence of 135

User Tsukasa
by
5.6k points

1 Answer

4 votes

Answer:

The solution has been given in the following attachment .

Explanation:

Find a recurrence relation for the number of sequences of 1s, 3s, and 5s whose terms-example-1
User Peter Boncz
by
5.0k points
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.