A234963 - cp's OEIS frontend

A234963 Number of ways to write n = k + m with k > 0 and m > 2 such that C(2*sigma(k) + phi(m), sigma(k) + phi(m)/2) - 1 is prime, where sigma(k) is the sum of all positive divisors of k and phi(.) is Euler's totient function.

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

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

cp's OEIS Frontend

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

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

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