Answer Happy

Recall that a bit string is a string of Os and 1s Describe the following sequence recursively. Include initial conditions and assume that the sequences begin with a₁. a₁ is the number of ways to go down an n-step staircase if you go down 1, 2, or 3 steps at a time.