A050176 - cp's OEIS frontend

A050176 T(n,k) = M0(n+1,k,f(n,k)), where M0(p,q,r) is the number of upright paths from (0,0) to (1,0) to (p,p-q) that meet the line y = x-r and do not rise above it and f(n,k) is the least t such that M0(n+1,k,f) is not 0.

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

[1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 2, 3, 1, 1, 4, 5, 5, 4, 1, 1, 5, 9, 5, 9, 5, 1, 1, 6, 14, 14, 14, 14, 6, 1, 1, 7, 20, 28, 14, 28, 20, 7, 1, 1, 8, 27, 48, 42, 42, 48, 27, 8, 1, 1, 9, 35, 75, 90, 42, 90, 75, 35, 9, 1, 1, 10, 44, 110, 165, 132, 132, 165, 110, 44, 10, 1]

cp's OEIS Frontend

A050176 T(n,k) = M0(n+1,k,f(n,k)), where M0(p,q,r) is the number of upright paths from (0,0) to (1,0) to (p,p-q) that meet the line y = x-r and do not rise above it and f(n,k) is the least t such that M0(n+1,k,f) is not 0.

Table of values

List of values

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

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

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