A237524 - cp's OEIS frontend

A237524 Number of ordered ways to write n = i + j + k with 0 < i <= j <= k such that phi(ijk) is a cube, where phi(.) is Euler's totient function.

n	a(n)
1	0
2	0
3	1
4	1
5	0
6	0
7	0
8	1
9	4
10	3
11	2
12	2
13	1
14	1
15	1
16	1
17	2
18	5
19	2
20	3
21	2
22	3
23	6
24	5
25	4
26	4
27	4
28	5
29	4
30	5
31	4
32	6
33	6
34	5
35	5
36	9
37	6
38	10
39	8
40	7
41	7
42	5
43	5
44	4
45	11
46	10
47	8
48	10
49	5
50	8
51	8
52	10
53	10
54	8
55	11
56	16
57	11
58	13
59	14
60	16
61	18
62	19
63	18
64	16
65	24
66	19
67	21
68	18
69	15
70	21
71	9
72	15
73	14
74	13
75	15
76	18
77	19
78	20
79	15
80	19

[0, 0, 1, 1, 0, 0, 0, 1, 4, 3, 2, 2, 1, 1, 1, 1, 2, 5, 2, 3, 2, 3, 6, 5, 4, 4, 4, 5, 4, 5, 4, 6, 6, 5, 5, 9, 6, 10, 8, 7, 7, 5, 5, 4, 11, 10, 8, 10, 5, 8, 8, 10, 10, 8, 11, 16, 11, 13, 14, 16, 18, 19, 18, 16, 24, 19, 21, 18, 15, 21, 9, 15, 14, 13, 15, 18, 19, 20, 15, 19]

cp's OEIS Frontend

A237524 Number of ordered ways to write n = i + j + k with 0 < i <= j <= k such that phi(ijk) is a cube, where phi(.) is Euler's totient function.

Table of values

List of values

n	a(n)
1	0
2	0
3	1
4	1
5	0
6	0
7	0
8	1
9	4
10	3
11	2
12	2
13	1
14	1
15	1
16	1
17	2
18	5
19	2
20	3
21	2
22	3
23	6
24	5
25	4
26	4
27	4
28	5
29	4
30	5
31	4
32	6
33	6
34	5
35	5
36	9
37	6
38	10
39	8
40	7
41	7
42	5
43	5
44	4
45	11
46	10
47	8
48	10
49	5
50	8
51	8
52	10
53	10
54	8
55	11
56	16
57	11
58	13
59	14
60	16
61	18
62	19
63	18
64	16
65	24
66	19
67	21
68	18
69	15
70	21
71	9
72	15
73	14
74	13
75	15
76	18
77	19
78	20
79	15
80	19

n	a(n)
1	0
2	0
3	1
4	1
5	0
6	0
7	0
8	1
9	4
10	3
11	2
12	2
13	1
14	1
15	1
16	1
17	2
18	5
19	2
20	3
21	2
22	3
23	6
24	5
25	4
26	4
27	4
28	5
29	4
30	5
31	4
32	6
33	6
34	5
35	5
36	9
37	6
38	10
39	8
40	7
41	7
42	5
43	5
44	4
45	11
46	10
47	8
48	10
49	5
50	8
51	8
52	10
53	10
54	8
55	11
56	16
57	11
58	13
59	14
60	16
61	18
62	19
63	18
64	16
65	24
66	19
67	21
68	18
69	15
70	21
71	9
72	15
73	14
74	13
75	15
76	18
77	19
78	20
79	15
80	19

cp's OEIS Frontend

A237524 Number of ordered ways to write n = i + j + k with 0 < i <= j <= k such that phi(i*j*k) is a cube, where phi(.) is Euler's totient function.

Table of values

List of values

A237524 Number of ordered ways to write n = i + j + k with 0 < i <= j <= k such that phi(ijk) is a cube, where phi(.) is Euler's totient function.

n	a(n)
1	0
2	0
3	1
4	1
5	0
6	0
7	0
8	1
9	4
10	3
11	2
12	2
13	1
14	1
15	1
16	1
17	2
18	5
19	2
20	3
21	2
22	3
23	6
24	5
25	4
26	4
27	4
28	5
29	4
30	5
31	4
32	6
33	6
34	5
35	5
36	9
37	6
38	10
39	8
40	7
41	7
42	5
43	5
44	4
45	11
46	10
47	8
48	10
49	5
50	8
51	8
52	10
53	10
54	8
55	11
56	16
57	11
58	13
59	14
60	16
61	18
62	19
63	18
64	16
65	24
66	19
67	21
68	18
69	15
70	21
71	9
72	15
73	14
74	13
75	15
76	18
77	19
78	20
79	15
80	19