A239617 - cp's OEIS frontend

A239617 Number of ways to write 2n = p + q with p, q and pi(2p) - pi(p) all prime, where pi(x) denotes the number of primes not exceeding x.

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

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

cp's OEIS Frontend

A239617 Number of ways to write 2n = p + q with p, q and pi(2p) - pi(p) all prime, where pi(x) denotes the number of primes not exceeding x.

Table of values

List of values

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

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

cp's OEIS Frontend

A239617 Number of ways to write 2*n = p + q with p, q and pi(2*p) - pi(p) all prime, where pi(x) denotes the number of primes not exceeding x.

Table of values

List of values

A239617 Number of ways to write 2n = p + q with p, q and pi(2p) - pi(p) all prime, where pi(x) denotes the number of primes not exceeding x.

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