in Combinatory
191 views
0 votes
0 votes
  1. 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.$ 
  2. What are the initial conditions?
  3. How many sequences of the type described in $(A)$ are there when $n$ is an integer with $n \geq 2?$
in Combinatory
by
191 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true