A276418 - cp's OEIS frontend

A276418 Starting a random walk on Z at 0 triangle T(j,k) gives the number of paths of length 2*j returning to 0 exactly k times.

n	a(n)
0	1
1	2
2	2
3	6
4	6
5	4
6	20
7	20
8	16
9	8
10	70
11	70
12	60
13	40
14	16
15	252
16	252
17	224
18	168
19	96
20	32
21	924
22	924
23	840
24	672
25	448
26	224
27	64
28	3432
29	3432
30	3168
31	2640
32	1920
33	1152
34	512
35	128
36	12870
37	12870
38	12012
39	10296
40	7920
41	5280
42	2880
43	1152
44	256
45	48620
46	48620
47	45760
48	40040
49	32032
50	22880
51	14080
52	7040
53	2560
54	512
55	184756
56	184756
57	175032
58	155584
59	128128
60	96096
61	64064
62	36608
63	16896
64	5632
65	1024

[1, 2, 2, 6, 6, 4, 20, 20, 16, 8, 70, 70, 60, 40, 16, 252, 252, 224, 168, 96, 32, 924, 924, 840, 672, 448, 224, 64, 3432, 3432, 3168, 2640, 1920, 1152, 512, 128, 12870, 12870, 12012, 10296, 7920, 5280, 2880, 1152, 256, 48620, 48620, 45760, 40040, 32032, 22880, 14080, 7040, 2560, 512, 184756, 184756, 175032, 155584, 128128, 96096, 64064, 36608, 16896, 5632, 1024]

cp's OEIS Frontend

A276418 Starting a random walk on Z at 0 triangle T(j,k) gives the number of paths of length 2*j returning to 0 exactly k times.

Table of values

List of values