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 $a_{1}, a_{2},\dots,a_{k},$ where $a_{1} = 1, a_{k} = n,$ ... What are the initial conditions? How many sequences of the type described in $(A)$ are there when $n$ is an integer with $n \geq 2?$

asked
May 1, 2020
in Combinatory
Lakshman Patel RJIT
21 views