A299693 - cp's OEIS frontend

A299693 Irregular triangle read by rows in which row n lists the total sum of the divisors of all numbers k such that the largest Dyck path of the symmetric representation of sigma(k) contains the point (n,n); or row n is 0 if no such k exists.

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

[1, 3, 4, 7, 6, 0, 12, 8, 15, 13, 18, 12, 0, 28, 14, 24, 0, 24, 31, 18, 39, 20, 0, 42, 32, 36, 24, 0, 60, 31, 42, 40, 0, 56, 30, 0, 72, 32, 63, 48, 54, 0, 48, 91, 38, 60, 56, 0, 90, 42, 0, 96, 44, 84, 0, 78, 72, 48, 0, 124, 57, 93, 72, 98, 54, 0, 120, 72, 0, 120, 80, 90, 60, 0, 168, 62, 96, 0, 104, 127, 84, 0]

cp's OEIS Frontend

A299693 Irregular triangle read by rows in which row n lists the total sum of the divisors of all numbers k such that the largest Dyck path of the symmetric representation of sigma(k) contains the point (n,n); or row n is 0 if no such k exists.

Table of values

List of values

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

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

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