A370808 - cp's OEIS frontend

A370808 Greatest number of multisets that can be obtained by choosing a divisor of each part of an integer partition of n.

n	a(n)
0	1
1	1
2	2
3	2
4	3
5	4
6	5
7	6
8	7
9	10
10	11
11	14
12	17
13	19
14	23
15	29
16	30
17	39
18	41
19	51
20	58
21	66
22	78
23	82
24	102
25	110
26	132
27	144
28	162
29	186
30	210
31	228
32	260
33	296
34	328
35	366
36	412
37	462
38	512
39	560
40	638
41	692
42	764
43	860
44	924
45	1028
46	1122
47	1276
48	1406
49	1528
50	1721
51	1898
52	2056
53	2318
54	2506
55	2812
56	3020
57	3442

[1, 1, 2, 2, 3, 4, 5, 6, 7, 10, 11, 14, 17, 19, 23, 29, 30, 39, 41, 51, 58, 66, 78, 82, 102, 110, 132, 144, 162, 186, 210, 228, 260, 296, 328, 366, 412, 462, 512, 560, 638, 692, 764, 860, 924, 1028, 1122, 1276, 1406, 1528, 1721, 1898, 2056, 2318, 2506, 2812, 3020, 3442]

cp's OEIS Frontend

A370808 Greatest number of multisets that can be obtained by choosing a divisor of each part of an integer partition of n.

Table of values

List of values