Consider asymmetric 1-D random walk with set of possible jumps {-1,+1,+2}. Sequence gives number of paths of length n ending at origin.

A176806

Consider asymmetric 1-D random walk with set of possible jumps {-1,+1,+2}. Sequence gives number of paths of length n ending at origin.

Terms

    a(0) =1a(1) =0a(2) =2a(3) =3a(4) =6a(5) =20a(6) =35a(7) =105a(8) =238a(9) =588a(10) =1512a(11) =3630a(12) =9339a(13) =23166a(14) =58487a(15) =148148a(16) =373230a(17) =949416a(18) =2406248a(19) =6122142a(20) =15591856a(21) =39729000a(22) =101432982a(23) =259049230a(24) =662421643a(25) =1695149220a(26) =4341026900a(27) =11125755615a(28) =28530984915a(29) =73213888650

External references