For n >= 1, let a(sub)n be the number of ways to write n as an ordered sum of positive integers, where each summand is at least 2.
For example, a(sub)5 = 3 as 5 = 2 + 3 = 3 + 2.
Find a recurrence relation for a(sub)n.