Conservative Sequences

Problem

A finite sequence {an}\{a_n\} with k⩾2k \geqslant 2 terms is called conservative if

∣ai−ai−1∣⩽2for all 2⩽i⩽k.|a_i - a_{i-1}| \leqslant 2 \qquad \text{for all } 2 \leqslant i \leqslant k.

Let TmT_m be the number of permutations of 1,2,…,m1, 2, \ldots, m that form conservative sequences, and SmS_m the number of such permutations that moreover start with 11. By convention S1=T1=1S_1 = T_1 = 1.

1. Find S4S_4 and T4T_4. 2. Find a closed formula for the sequence {Sn+3−Sn+2−Sn}\{S_{n+3} - S_{n+2} - S_n\}. 3. Find a closed formula for the sequence {Tn+3−Tn+2−Tn}\{T_{n+3} - T_{n+2} - T_n\}.

Answer

Solution

Difficulty9/10
Topicscombinatorics, Counting, Recursion, sequences, Casework

Whiteboard

Your sketch is saved only in this browser. To share it, export your drawing as an image (whiteboard menu → Export as → PNG), then upload that image in the comments below.

Discussion

Ask questions, share alternate solutions, and use LaTeX freely.

0 comments
Log in to join the discussion.

No comments yet.