0 votes 0 votes 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,$ and $a_{j} < a_{j+1} \:\text{for}\: j = 1, 2,\dots,k − 1.$ 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?$ Combinatory kenneth-rosen discrete-mathematics counting descriptive + – admin asked May 1, 2020 admin 214 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.