A048113 - cp's OEIS frontend

A048113 Triangular array T read by rows: T(h,k) = number of paths consisting of steps from (1,1) to (h,k) such that each step has length 1 directed up or right and each vertex (i,j) satisfies i/2<=j<=2i, for h=0,1,2,... and k=0,1,2,...

n	a(n)
0	0
1	0
2	0
3	0
4	1
5	0
6	0
7	1
8	1
9	0
10	0
11	0
12	2
13	0
14	0
15	0
16	0
17	2
18	2
19	0
20	0
21	0
22	0
23	2
24	4
25	2
26	0
27	0
28	0
29	0
30	0
31	6
32	6
33	0
34	0
35	0
36	0
37	0
38	0
39	6
40	12
41	6
42	0
43	0
44	0
45	0
46	0
47	0
48	6
49	18
50	18
51	6
52	0
53	0
54	0
55	0
56	0
57	0
58	0
59	24
60	36
61	24
62	0
63	0
64	0
65	0
66	0
67	0
68	0
69	0
70	24
71	60
72	60
73	24
74	0
75	0
76	0
77	0
78	0
79	0
80	0
81	0
82	24
83	84
84	120
85	84
86	24
87	0
88	0
89	0
90	0

[0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 2, 0, 0, 0, 0, 2, 2, 0, 0, 0, 0, 2, 4, 2, 0, 0, 0, 0, 0, 6, 6, 0, 0, 0, 0, 0, 0, 6, 12, 6, 0, 0, 0, 0, 0, 0, 6, 18, 18, 6, 0, 0, 0, 0, 0, 0, 0, 24, 36, 24, 0, 0, 0, 0, 0, 0, 0, 0, 24, 60, 60, 24, 0, 0, 0, 0, 0, 0, 0, 0, 24, 84, 120, 84, 24, 0, 0, 0, 0]

cp's OEIS Frontend

A048113 Triangular array T read by rows: T(h,k) = number of paths consisting of steps from (1,1) to (h,k) such that each step has length 1 directed up or right and each vertex (i,j) satisfies i/2<=j<=2i, for h=0,1,2,... and k=0,1,2,...

Table of values

List of values

n	a(n)
0	0
1	0
2	0
3	0
4	1
5	0
6	0
7	1
8	1
9	0
10	0
11	0
12	2
13	0
14	0
15	0
16	0
17	2
18	2
19	0
20	0
21	0
22	0
23	2
24	4
25	2
26	0
27	0
28	0
29	0
30	0
31	6
32	6
33	0
34	0
35	0
36	0
37	0
38	0
39	6
40	12
41	6
42	0
43	0
44	0
45	0
46	0
47	0
48	6
49	18
50	18
51	6
52	0
53	0
54	0
55	0
56	0
57	0
58	0
59	24
60	36
61	24
62	0
63	0
64	0
65	0
66	0
67	0
68	0
69	0
70	24
71	60
72	60
73	24
74	0
75	0
76	0
77	0
78	0
79	0
80	0
81	0
82	24
83	84
84	120
85	84
86	24
87	0
88	0
89	0
90	0

n	a(n)
0	0
1	0
2	0
3	0
4	1
5	0
6	0
7	1
8	1
9	0
10	0
11	0
12	2
13	0
14	0
15	0
16	0
17	2
18	2
19	0
20	0
21	0
22	0
23	2
24	4
25	2
26	0
27	0
28	0
29	0
30	0
31	6
32	6
33	0
34	0
35	0
36	0
37	0
38	0
39	6
40	12
41	6
42	0
43	0
44	0
45	0
46	0
47	0
48	6
49	18
50	18
51	6
52	0
53	0
54	0
55	0
56	0
57	0
58	0
59	24
60	36
61	24
62	0
63	0
64	0
65	0
66	0
67	0
68	0
69	0
70	24
71	60
72	60
73	24
74	0
75	0
76	0
77	0
78	0
79	0
80	0
81	0
82	24
83	84
84	120
85	84
86	24
87	0
88	0
89	0
90	0

n	a(n)
0	0
1	0
2	0
3	0
4	1
5	0
6	0
7	1
8	1
9	0
10	0
11	0
12	2
13	0
14	0
15	0
16	0
17	2
18	2
19	0
20	0
21	0
22	0
23	2
24	4
25	2
26	0
27	0
28	0
29	0
30	0
31	6
32	6
33	0
34	0
35	0
36	0
37	0
38	0
39	6
40	12
41	6
42	0
43	0
44	0
45	0
46	0
47	0
48	6
49	18
50	18
51	6
52	0
53	0
54	0
55	0
56	0
57	0
58	0
59	24
60	36
61	24
62	0
63	0
64	0
65	0
66	0
67	0
68	0
69	0
70	24
71	60
72	60
73	24
74	0
75	0
76	0
77	0
78	0
79	0
80	0
81	0
82	24
83	84
84	120
85	84
86	24
87	0
88	0
89	0
90	0