A383858 - cp's OEIS frontend

A383858 Irregular triangle read by rows: T(n,k) (n >= 4, 4 <= k <= A384502(n)) is the smallest n-digit number m with k distinct prime factors, such that these factors can be divided into two subsets of at least two elements each, both summing to the same value. If no such number exists, T(n,k) = -1.

n	a(n)
4	2145
5	2310
6	10725
7	10374
8	101065
9	100050
10	255255
11	510510
12	1005993
13	1000350
14	1036035
15	1009470
16	10006081
17	10000130
18	10012065
19	10004610
20	100010225
21	100001300
22	100001195
23	100009910
24	111546435
25	223092870
26	1000083889
27	1000008758
28	1000001751
29	1000005270
30	1002569295
31	1001110110

[2145, 2310, 10725, 10374, 101065, 100050, 255255, 510510, 1005993, 1000350, 1036035, 1009470, 10006081, 10000130, 10012065, 10004610, 100010225, 100001300, 100001195, 100009910, 111546435, 223092870, 1000083889, 1000008758, 1000001751, 1000005270, 1002569295, 1001110110]

cp's OEIS Frontend

A383858 Irregular triangle read by rows: T(n,k) (n >= 4, 4 <= k <= A384502(n)) is the smallest n-digit number m with k distinct prime factors, such that these factors can be divided into two subsets of at least two elements each, both summing to the same value. If no such number exists, T(n,k) = -1.

Table of values

List of values