Consider 1-D random walk with jumps up to the fourth neighbor, i.e., set of possible jumps is {-4,-3,-2,-1,+1,+2,+3,+4}. Sequence gives number of paths of length n ending at origin.
A181072
Consider 1-D random walk with jumps up to the fourth neighbor, i.e., set of possible jumps is {-4,-3,-2,-1,+1,+2,+3,+4}. Sequence gives number of paths of length n ending at origin.
Terms
- a(0) =1a(1) =0a(2) =8a(3) =36a(4) =296a(5) =2030a(6) =15200a(7) =112308a(8) =845320a(9) =6386076a(10) =48582438a(11) =371138460a(12) =2846769992a(13) =21905812786a(14) =169041544568
External references
- oeis: A181072