The Broken Step
A staircase has 12 steps. You start at the bottom (step 0) and must finish on step 12, and each stride carries you up exactly 1 or exactly 2 steps. Step 7 is broken: no stride may end on step 7. How many different climbs (sequences of strides) are possible? Give an integer.
Related problems & prerequisites
Worth solving first
- Tiling with Dominoes 3.9/10
- No Consecutive Elements 3.5/10
Source: Original problem written for AxiomIQ.