The length of a lattice walk is the number of steps taken. Write the counting sequence – including the general term and starting from the walks of length zero– for walks of length n that start at (0, 0) and include point (2, 2) with allowable steps → and ↑. Written in terms of n, the general term will require restrictions on what n are allowable

#### Top Answer

in this sequence assume n=0,1,2,... will be... View the full answer

#### Sign up to view the full answer

#### Other Answers

For n =0 , 1 , 2 , … n=0,1,2,… what I've got is: 0 , 0 , 0 , 0 , 4 ! 2 ! 2 ! , 6 ⋅ 2 ⋅... View the full answer

- I don't get. Can you explain what are you doing?
- khan23a
- Sep 14, 2016 at 3:43am