A236460 - cp's OEIS frontend

A236460 Number of ordered ways to write n = k + m with k > 0 and m > 0 such that p = phi(k) + phi(m)/2 - 1, prime(p) + 4 and prime(p) + 6 are all prime, 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	0
19	0
20	0
21	0
22	0
23	0
24	1
25	0
26	0
27	1
28	0
29	1
30	1
31	1
32	2
33	1
34	0
35	1
36	2
37	2
38	2
39	1
40	1
41	2
42	0
43	4
44	1
45	2
46	1
47	5
48	2
49	1
50	3
51	1
52	1
53	3
54	2
55	6
56	3
57	0
58	2
59	5
60	5
61	6
62	3
63	4
64	5
65	3
66	4
67	4
68	4
69	6
70	3
71	2
72	6
73	2
74	3
75	2
76	10
77	2
78	3
79	1
80	6
81	1
82	4
83	0
84	2
85	3
86	4
87	2
88	4
89	0
90	4
91	0
92	3
93	2
94	3
95	0
96	4
97	0
98	1
99	1
100	4

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 2, 1, 0, 1, 2, 2, 2, 1, 1, 2, 0, 4, 1, 2, 1, 5, 2, 1, 3, 1, 1, 3, 2, 6, 3, 0, 2, 5, 5, 6, 3, 4, 5, 3, 4, 4, 4, 6, 3, 2, 6, 2, 3, 2, 10, 2, 3, 1, 6, 1, 4, 0, 2, 3, 4, 2, 4, 0, 4, 0, 3, 2, 3, 0, 4, 0, 1, 1, 4]

cp's OEIS Frontend

A236460 Number of ordered ways to write n = k + m with k > 0 and m > 0 such that p = phi(k) + phi(m)/2 - 1, prime(p) + 4 and prime(p) + 6 are all prime, 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	0
19	0
20	0
21	0
22	0
23	0
24	1
25	0
26	0
27	1
28	0
29	1
30	1
31	1
32	2
33	1
34	0
35	1
36	2
37	2
38	2
39	1
40	1
41	2
42	0
43	4
44	1
45	2
46	1
47	5
48	2
49	1
50	3
51	1
52	1
53	3
54	2
55	6
56	3
57	0
58	2
59	5
60	5
61	6
62	3
63	4
64	5
65	3
66	4
67	4
68	4
69	6
70	3
71	2
72	6
73	2
74	3
75	2
76	10
77	2
78	3
79	1
80	6
81	1
82	4
83	0
84	2
85	3
86	4
87	2
88	4
89	0
90	4
91	0
92	3
93	2
94	3
95	0
96	4
97	0
98	1
99	1
100	4

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	0
19	0
20	0
21	0
22	0
23	0
24	1
25	0
26	0
27	1
28	0
29	1
30	1
31	1
32	2
33	1
34	0
35	1
36	2
37	2
38	2
39	1
40	1
41	2
42	0
43	4
44	1
45	2
46	1
47	5
48	2
49	1
50	3
51	1
52	1
53	3
54	2
55	6
56	3
57	0
58	2
59	5
60	5
61	6
62	3
63	4
64	5
65	3
66	4
67	4
68	4
69	6
70	3
71	2
72	6
73	2
74	3
75	2
76	10
77	2
78	3
79	1
80	6
81	1
82	4
83	0
84	2
85	3
86	4
87	2
88	4
89	0
90	4
91	0
92	3
93	2
94	3
95	0
96	4
97	0
98	1
99	1
100	4

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	0
19	0
20	0
21	0
22	0
23	0
24	1
25	0
26	0
27	1
28	0
29	1
30	1
31	1
32	2
33	1
34	0
35	1
36	2
37	2
38	2
39	1
40	1
41	2
42	0
43	4
44	1
45	2
46	1
47	5
48	2
49	1
50	3
51	1
52	1
53	3
54	2
55	6
56	3
57	0
58	2
59	5
60	5
61	6
62	3
63	4
64	5
65	3
66	4
67	4
68	4
69	6
70	3
71	2
72	6
73	2
74	3
75	2
76	10
77	2
78	3
79	1
80	6
81	1
82	4
83	0
84	2
85	3
86	4
87	2
88	4
89	0
90	4
91	0
92	3
93	2
94	3
95	0
96	4
97	0
98	1
99	1
100	4