A339246 - cp's OEIS frontend

A339246 a(n) = 1 for n <= 2; thereafter a(n) is the number of partitions of n where every part k appears at least a(k) times.

n	a(n)
0	1
1	1
2	1
3	2
4	3
5	3
6	5
7	5
8	7
9	8
10	10
11	11
12	15
13	16
14	20
15	23
16	28
17	31
18	38
19	41
20	50
21	56
22	66
23	72
24	86
25	94
26	110
27	122
28	140
29	154
30	178
31	195
32	223
33	245
34	276
35	303
36	344
37	376
38	421
39	461
40	513
41	561
42	627
43	681
44	756
45	824
46	909
47	988
48	1092
49	1182
50	1301
51	1413
52	1547
53	1673
54	1834
55	1979
56	2165
57	2341
58	2548
59	2746
60	2993

[1, 1, 1, 2, 3, 3, 5, 5, 7, 8, 10, 11, 15, 16, 20, 23, 28, 31, 38, 41, 50, 56, 66, 72, 86, 94, 110, 122, 140, 154, 178, 195, 223, 245, 276, 303, 344, 376, 421, 461, 513, 561, 627, 681, 756, 824, 909, 988, 1092, 1182, 1301, 1413, 1547, 1673, 1834, 1979, 2165, 2341, 2548, 2746, 2993]

cp's OEIS Frontend

A339246 a(n) = 1 for n <= 2; thereafter a(n) is the number of partitions of n where every part k appears at least a(k) times.

Table of values

List of values