A369385 - cp's OEIS frontend

A369385 The smallest number k that can be partitioned in n ways as the sum of two numbers from A109611.

n	a(n)
0	1
1	4
2	10
3	22
4	34
5	60
6	118
7	112
8	142
9	198
10	270
11	298
12	280
13	364
14	508
15	460
16	588
17	490
18	580
19	658
20	858
21	670
22	700
23	994
24	880
25	1240
26	1078
27	1288
28	910
29	1120
30	1428
31	1510
32	1300
33	1330
34	1930
35	1960
36	1750
37	1540
38	2128
39	2170
40	2140
41	2470
42	2560
43	2380
44	2590
45	2770
46	2728
47	3838
48	2968
49	4000

[1, 4, 10, 22, 34, 60, 118, 112, 142, 198, 270, 298, 280, 364, 508, 460, 588, 490, 580, 658, 858, 670, 700, 994, 880, 1240, 1078, 1288, 910, 1120, 1428, 1510, 1300, 1330, 1930, 1960, 1750, 1540, 2128, 2170, 2140, 2470, 2560, 2380, 2590, 2770, 2728, 3838, 2968, 4000]

cp's OEIS Frontend

A369385 The smallest number k that can be partitioned in n ways as the sum of two numbers from A109611.

Table of values

List of values