A207852 - cp's OEIS frontend

A207852 Smallest number m such that there are exactly n ways to partition the numbers {1,...,m} into nonempty sets P and S with the product of the elements of P equal to the sum of elements in S.

n	a(n)
0	1
1	3
2	12
3	10
4	19
5	26
6	33
7	39
8	55
9	74
10	48
11	62
12	71
13	99
14	45
15	140
16	96
17	176
18	104
19	144
20	159
21	175
22	230
23	191
24	320
25	328
26	240
27	334
28	259
29	344
30	279
31	308
32	303
33	505
34	419
35	560
36	714
37	550
38	455
39	665
40	684
41	670
42	751
43	935
44	899
45	800
46	1051
47	776
48	928
49	602
50	749
51	1104
52	689
53	1295
54	1364

[1, 3, 12, 10, 19, 26, 33, 39, 55, 74, 48, 62, 71, 99, 45, 140, 96, 176, 104, 144, 159, 175, 230, 191, 320, 328, 240, 334, 259, 344, 279, 308, 303, 505, 419, 560, 714, 550, 455, 665, 684, 670, 751, 935, 899, 800, 1051, 776, 928, 602, 749, 1104, 689, 1295, 1364]

cp's OEIS Frontend

A207852 Smallest number m such that there are exactly n ways to partition the numbers {1,...,m} into nonempty sets P and S with the product of the elements of P equal to the sum of elements in S.

Table of values

List of values