A236456 - cp's OEIS frontend

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

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

cp's OEIS Frontend

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

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

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