A237130 - cp's OEIS frontend

A237130 Number of ordered ways to write n = k + m with k > 0 and m > 0 such that both {3k - 1, 3k + 1} and {phi(m) - 1, phi(m) + 1} are twin prime pairs, where phi(.) is Euler's totient function.

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

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

cp's OEIS Frontend

A237130 Number of ordered ways to write n = k + m with k > 0 and m > 0 such that both {3k - 1, 3k + 1} and {phi(m) - 1, phi(m) + 1} are twin prime pairs, where phi(.) is Euler's totient function.

Table of values

List of values

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

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

cp's OEIS Frontend

A237130 Number of ordered ways to write n = k + m with k > 0 and m > 0 such that both {3*k - 1, 3*k + 1} and {phi(m) - 1, phi(m) + 1} are twin prime pairs, where phi(.) is Euler's totient function.

Table of values

List of values

A237130 Number of ordered ways to write n = k + m with k > 0 and m > 0 such that both {3k - 1, 3k + 1} and {phi(m) - 1, phi(m) + 1} are twin prime pairs, where phi(.) is Euler's totient function.

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