Consider the 1-D random walk with jumps to next-nearest neighbors. Sequence gives number of paths of length n ending at origin.
A092765
Consider the 1-D random walk with jumps to next-nearest neighbors. Sequence gives number of paths of length n ending at origin.
Terms
- a(0) =1a(1) =0a(2) =4a(3) =6a(4) =36a(5) =100a(6) =430a(7) =1470a(8) =5796a(9) =21336a(10) =82404a(11) =312180a(12) =1203246a(13) =4617756a(14) =17846686a(15) =68974906a(16) =267498660a(17) =1038555024a(18) =4040525320a(19) =15739195680a(20) =61399048036a(21) =239788778760a(22) =937536139764
External references
- oeis: A092765