a) Find a recurrence relation for the number of strictly
Chapter 10, Problem 6E(choose chapter or problem)
Problem 6E
a) Find a recurrence relation for the number of strictly increasing sequences of positive integers that have 1 as their first term and n as their last term, where n is a positive integer. That is, sequences a1, a2,.... ak, where a1 = 1. ak = n, and aj < aj+1 for j = 1, 2, ..., k – 1.
b) What are the initial conditions?
c) How many sequences of the type described in (a) are there when n is an integer with n ≥ 2?
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer