MathDB
Number of n-tuples with given condition

Source: 2016 KMO Senior #4

November 12, 2016
combinatorics

Problem Statement

For a positive integer nn, SnS_n is the set of positive integer nn-tuples (a1,a2,,an)(a_1,a_2, \cdots ,a_n) which satisfies the following.
(i). a1=1a_1=1.
(ii). ai+1ai+1a_{i+1} \le a_i+1.
For knk \le n, define NkN_k as the number of nn-tuples (a1,a2,an)Sn(a_1, a_2, \cdots a_n) \in S_n such that ak=1,ak+1=2a_k=1, a_{k+1}=2.
Find the sum N1+N2+Nk1N_1 + N_2+ \cdots N_{k-1}.