2015 AIME II Problems/Problem 10

Revision as of 18:23, 26 March 2015 by Swe1 (talk | contribs) (Create Page)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Problem 10

Call a permutation $a_1, a_2, \ldots, a_n$ of the integers $1, 2, \ldots, n$ quasi-increasing if $a_k \leq a_{k+1} + 2$ for each $1 \leq k \leq n-1$. For example, 53421 and 14253 are quasi-increasing permutations of the integers $1, 2, 3, 4, 5$, but 45123 is not. Find the number of quasi-increasing permutations of the integers $1, 2, \ldots, 7$.