A118083 - cp's OEIS frontend

A118083 Number of partitions of n such that largest part k occurs at least floor(k/2) times.

n	a(n)
0	1
1	1
2	2
3	3
4	4
5	5
6	7
7	8
8	11
9	13
10	17
11	20
12	26
13	30
14	38
15	45
16	55
17	64
18	79
19	91
20	110
21	128
22	152
23	176
24	209
25	240
26	282
27	325
28	379
29	434
30	505
31	576
32	666
33	760
34	873
35	993
36	1139
37	1290
38	1473
39	1668
40	1897
41	2141
42	2430
43	2736
44	3095
45	3481
46	3925
47	4404
48	4958
49	5550
50	6232
51	6968
52	7805
53	8710

[1, 1, 2, 3, 4, 5, 7, 8, 11, 13, 17, 20, 26, 30, 38, 45, 55, 64, 79, 91, 110, 128, 152, 176, 209, 240, 282, 325, 379, 434, 505, 576, 666, 760, 873, 993, 1139, 1290, 1473, 1668, 1897, 2141, 2430, 2736, 3095, 3481, 3925, 4404, 4958, 5550, 6232, 6968, 7805, 8710]

cp's OEIS Frontend

A118083 Number of partitions of n such that largest part k occurs at least floor(k/2) times.

Table of values

List of values