A234470 - cp's OEIS frontend

A234470 Number of ways to write n = k + m with k > 0 and m > 2 such that p(k + phi(m)/2) is prime, where p(.) is the partition function (A000041) and phi(.) is Euler's totient function.

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

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

cp's OEIS Frontend

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

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

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