A181072 - cp's OEIS frontend

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.

n	a(n)
0	1
1	0
2	8
3	36
4	296
5	2030
6	15200
7	112308
8	845320
9	6386076
10	48582438
11	371138460
12	2846769992
13	21905812786
14	169041544568
15	1307602672376
16	10136307859080
17	78721657307320
18	612391634798156
19	4770987007606224
20	37219155177139126
21	290702353768374570
22	2273036878855399720

[1, 0, 8, 36, 296, 2030, 15200, 112308, 845320, 6386076, 48582438, 371138460, 2846769992, 21905812786, 169041544568, 1307602672376, 10136307859080, 78721657307320, 612391634798156, 4770987007606224, 37219155177139126, 290702353768374570, 2273036878855399720]

cp's OEIS Frontend

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.

Table of values

List of values