A238766 - cp's OEIS frontend

A238766 Number of ordered ways to write n = k + m (k > 0 and m > 0) such that prime(prime(k)) - prime(k) + 1, prime(prime(2k+1)) - prime(2k+1) + 1 and prime(prime(m)) - prime(m) + 1 are all prime.

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

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

cp's OEIS Frontend

A238766 Number of ordered ways to write n = k + m (k > 0 and m > 0) such that prime(prime(k)) - prime(k) + 1, prime(prime(2k+1)) - prime(2k+1) + 1 and prime(prime(m)) - prime(m) + 1 are all prime.

Table of values

List of values

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

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

cp's OEIS Frontend

A238766 Number of ordered ways to write n = k + m (k > 0 and m > 0) such that prime(prime(k)) - prime(k) + 1, prime(prime(2*k+1)) - prime(2*k+1) + 1 and prime(prime(m)) - prime(m) + 1 are all prime.

Table of values

List of values

A238766 Number of ordered ways to write n = k + m (k > 0 and m > 0) such that prime(prime(k)) - prime(k) + 1, prime(prime(2k+1)) - prime(2k+1) + 1 and prime(prime(m)) - prime(m) + 1 are all prime.

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