A236573 - cp's OEIS frontend

A236573 Number of ordered ways to write n = k + m (k > 0, m > 0) such that p = 2k + phi(m) - 1, prime(p + 2) + 2 and 2n - p are all prime, where phi(.) is Euler's totient function.

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

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

cp's OEIS Frontend

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

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

cp's OEIS Frontend

A236573 Number of ordered ways to write n = k + m (k > 0, m > 0) such that p = 2*k + phi(m) - 1, prime(p + 2) + 2 and 2*n - p are all prime, where phi(.) is Euler's totient function.

Table of values

List of values

A236573 Number of ordered ways to write n = k + m (k > 0, m > 0) such that p = 2k + phi(m) - 1, prime(p + 2) + 2 and 2n - p are all prime, where phi(.) is Euler's totient function.

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