A236468 - cp's OEIS frontend

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

[0, 0, 0, 0, 0, 0, 0, 2, 2, 1, 3, 1, 1, 2, 2, 4, 0, 1, 2, 2, 1, 2, 1, 1, 2, 0, 3, 2, 2, 3, 4, 2, 1, 2, 5, 3, 4, 0, 6, 6, 1, 3, 1, 5, 4, 5, 2, 5, 1, 7, 1, 3, 2, 5, 1, 4, 1, 7, 0, 5, 4, 1, 8, 1, 5, 5, 1, 2, 5, 4, 4, 4, 4, 1, 5, 1, 7, 3, 3, 2, 2, 1, 8, 3, 3, 2, 2, 2, 6, 3, 7, 2, 6, 5, 1, 1, 5, 4, 9, 3]

cp's OEIS Frontend

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

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

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