A237123 - cp's OEIS frontend

A237123 Number of ways to write n = i + j + k with 0 < i < j < k such that phi(i), phi(j) and phi(k) are all cubes, where phi(.) is Euler's totient function.

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

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 2, 0, 0, 1, 2, 1, 0, 1, 2, 1, 0, 0, 1, 2, 2, 1, 0, 0, 2, 1, 0, 0, 2, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1]

cp's OEIS Frontend

A237123 Number of ways to write n = i + j + k with 0 < i < j < k such that phi(i), phi(j) and phi(k) are all cubes, where phi(.) is Euler's totient function.

Table of values

List of values

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

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

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