Consider 1-D random walk with jumps up to the third neighbor, i.e., set of possible jumps is {-3,-2,-1,+1,+2,+3}. Sequence gives number of paths of length n ending at origin.
A117813
Consider 1-D random walk with jumps up to the third neighbor, i.e., set of possible jumps is {-3,-2,-1,+1,+2,+3}. Sequence gives number of paths of length n ending at origin.
Terms
- a(0) =1a(1) =0a(2) =6a(3) =18a(4) =122a(5) =600a(6) =3450a(7) =18914a(8) =107338a(9) =606816a(10) =3466356a(11) =19852470a(12) =114239642a(13) =659275760a(14) =3815952426a(15) =22138925718a(16) =128718762250a(17) =749773729952
External references
- oeis: A117813