Let $b_n$ be the number of compositions of $n$ into parts that are larger than $2$. Find a recurrence relation satisfied by $b_n$
compositions and recurrence relation
1
$\begingroup$
combinatorics
-
0Typing `$b_n$` will give you $b_n$. See [this](http://meta.math.stackexchange.com/questions/5020/mathjax-basic-tutorial-and-quick-reference) for a basic reference. – 2012-11-05
-
0Just to be sure: you do mean compositions and not partitions, so that $b_7=3$, not $2$? – 2012-11-05
-
0yes that is correct it is compositions – 2012-11-05