A232353 - cp's OEIS frontend

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

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

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

cp's OEIS Frontend

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

Table of values

List of values

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

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

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