A050144 - cp's OEIS frontend

A050144 T(n,k) = M(2n-1,n-1,k-1), 0 <= k <= n, n >= 0, where M(p,q,r) is the number of upright paths from (0,0) to (p,p-q) that meet the line y = x+r and do not rise above it.

n	a(n)
0	0
1	1
2	0
3	1
4	1
5	1
6	2
7	3
8	4
9	1
10	5
11	9
12	14
13	6
14	1
15	14
16	28
17	48
18	27
19	8
20	1
21	42
22	90
23	165
24	110
25	44
26	10
27	1
28	132
29	297
30	572
31	429
32	208
33	65
34	12
35	1
36	429
37	1001
38	2002
39	1638
40	910
41	350
42	90
43	14
44	1
45	1430
46	3432
47	7072
48	6188
49	3808
50	1700
51	544
52	119
53	16
54	1

[0, 1, 0, 1, 1, 1, 2, 3, 4, 1, 5, 9, 14, 6, 1, 14, 28, 48, 27, 8, 1, 42, 90, 165, 110, 44, 10, 1, 132, 297, 572, 429, 208, 65, 12, 1, 429, 1001, 2002, 1638, 910, 350, 90, 14, 1, 1430, 3432, 7072, 6188, 3808, 1700, 544, 119, 16, 1]

cp's OEIS Frontend

A050144 T(n,k) = M(2n-1,n-1,k-1), 0 <= k <= n, n >= 0, where M(p,q,r) is the number of upright paths from (0,0) to (p,p-q) that meet the line y = x+r and do not rise above it.

Table of values

List of values