A373047 - cp's OEIS frontend

A373047 Least k with exactly n partitions k = x + y + z satisfying sigma(k) = sigma(x) + sigma(y) + sigma(z), where sigma*(k) is the sum of the anti-divisors of k.

n	a(n)
1	11
2	33
3	16
4	20
5	26
6	37
7	40
8	19
9	43
10	46
11	93
12	91
13	80
14	76
15	39
16	78
17	155
18	103
19	74
20	135
21	128
22	152
23	116
24	117
25	190
26	104
27	187
28	138
29	168
30	147
31	160
32	223
33	208
34	403
35	281
36	173
37	163
38	170
39	250
40	243
41	272
42	257
43	258
44	232
45	222
46	278
47	266
48	245
49	352
50	253
51	279
52	256
53	288
54	295
55	231
56	291

[11, 33, 16, 20, 26, 37, 40, 19, 43, 46, 93, 91, 80, 76, 39, 78, 155, 103, 74, 135, 128, 152, 116, 117, 190, 104, 187, 138, 168, 147, 160, 223, 208, 403, 281, 173, 163, 170, 250, 243, 272, 257, 258, 232, 222, 278, 266, 245, 352, 253, 279, 256, 288, 295, 231, 291]

cp's OEIS Frontend

A373047 Least k with exactly n partitions k = x + y + z satisfying sigma(k) = sigma(x) + sigma(y) + sigma(z), where sigma*(k) is the sum of the anti-divisors of k.

Table of values

List of values

n	a(n)
1	11
2	33
3	16
4	20
5	26
6	37
7	40
8	19
9	43
10	46
11	93
12	91
13	80
14	76
15	39
16	78
17	155
18	103
19	74
20	135
21	128
22	152
23	116
24	117
25	190
26	104
27	187
28	138
29	168
30	147
31	160
32	223
33	208
34	403
35	281
36	173
37	163
38	170
39	250
40	243
41	272
42	257
43	258
44	232
45	222
46	278
47	266
48	245
49	352
50	253
51	279
52	256
53	288
54	295
55	231
56	291

n	a(n)
1	11
2	33
3	16
4	20
5	26
6	37
7	40
8	19
9	43
10	46
11	93
12	91
13	80
14	76
15	39
16	78
17	155
18	103
19	74
20	135
21	128
22	152
23	116
24	117
25	190
26	104
27	187
28	138
29	168
30	147
31	160
32	223
33	208
34	403
35	281
36	173
37	163
38	170
39	250
40	243
41	272
42	257
43	258
44	232
45	222
46	278
47	266
48	245
49	352
50	253
51	279
52	256
53	288
54	295
55	231
56	291

cp's OEIS Frontend

A373047 Least k with exactly n partitions k = x + y + z satisfying sigma*(k) = sigma*(x) + sigma*(y) + sigma*(z), where sigma*(k) is the sum of the anti-divisors of k.

Table of values

List of values

A373047 Least k with exactly n partitions k = x + y + z satisfying sigma(k) = sigma(x) + sigma(y) + sigma(z), where sigma*(k) is the sum of the anti-divisors of k.

n	a(n)
1	11
2	33
3	16
4	20
5	26
6	37
7	40
8	19
9	43
10	46
11	93
12	91
13	80
14	76
15	39
16	78
17	155
18	103
19	74
20	135
21	128
22	152
23	116
24	117
25	190
26	104
27	187
28	138
29	168
30	147
31	160
32	223
33	208
34	403
35	281
36	173
37	163
38	170
39	250
40	243
41	272
42	257
43	258
44	232
45	222
46	278
47	266
48	245
49	352
50	253
51	279
52	256
53	288
54	295
55	231
56	291