A234475 - cp's OEIS frontend

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

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

cp's OEIS Frontend

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

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

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