A235061 - cp's OEIS frontend

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

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

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

cp's OEIS Frontend

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

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

cp's OEIS Frontend

A235061 Number of ways to write n = k*(k+1)/2 + m with k > 0 and m > 0 such that prime(k*(k+1)/2) + phi(m) is prime, where phi(.) is Euler's totient function.

Table of values

List of values

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

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