A079124 - cp's OEIS frontend

A079124 Number of ways to partition n into distinct positive integers <= phi(n), where phi is Euler's totient function (A000010).

n	a(n)
0	1
1	1
2	0
3	1
4	0
5	2
6	0
7	4
8	1
9	5
10	1
11	11
12	0
13	17
14	4
15	13
16	13
17	37
18	2
19	53
20	13
21	51
22	35
23	103
24	10
25	135
26	78
27	167
28	89
29	255
30	4
31	339
32	253
33	378
34	306
35	542
36	121
37	759
38	558
39	872
40	498
41	1259
42	121
43	1609
44	1180
45	1677
46	1665
47	2589
48	808
49	3250
50	1969
51	3844
52	3325
53	5119
54	1850
55	6268
56	4758
57	7546
58	7070

[1, 1, 0, 1, 0, 2, 0, 4, 1, 5, 1, 11, 0, 17, 4, 13, 13, 37, 2, 53, 13, 51, 35, 103, 10, 135, 78, 167, 89, 255, 4, 339, 253, 378, 306, 542, 121, 759, 558, 872, 498, 1259, 121, 1609, 1180, 1677, 1665, 2589, 808, 3250, 1969, 3844, 3325, 5119, 1850, 6268, 4758, 7546, 7070]

cp's OEIS Frontend

A079124 Number of ways to partition n into distinct positive integers <= phi(n), where phi is Euler's totient function (A000010).

Table of values

List of values