A236968 - cp's OEIS frontend

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

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

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

cp's OEIS Frontend

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

Table of values

List of values

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

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

cp's OEIS Frontend

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

Table of values

List of values

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

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