A234615 - cp's OEIS frontend

A234615 Number of ways to write n = k + m with k > 0 and m > 0 such that p = prime(k) + phi(m) and q(p) - 1 are both prime, where phi(.) is Euler's totient function and q(.) is the strict partition function (A000009).

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

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

cp's OEIS Frontend

A234615 Number of ways to write n = k + m with k > 0 and m > 0 such that p = prime(k) + phi(m) and q(p) - 1 are both prime, where phi(.) is Euler's totient function and q(.) is the strict partition function (A000009).

Table of values

List of values

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

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

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