A239428 - cp's OEIS frontend

A239428 Number of ordered ways to write n = k + m with 0 < k <= m such that pi(2k) - pi(k) and pi(2m) - pi(m) are both prime, where pi(x) denotes the number of primes not exceeding x.

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

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

cp's OEIS Frontend

A239428 Number of ordered ways to write n = k + m with 0 < k <= m such that pi(2k) - pi(k) and pi(2m) - pi(m) are both 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	0
6	0
7	0
8	1
9	0
10	1
11	1
12	2
13	2
14	2
15	3
16	2
17	3
18	3
19	2
20	4
21	2
22	4
23	2
24	2
25	3
26	1
27	4
28	2
29	3
30	3
31	2
32	4
33	1
34	5
35	4
36	5
37	6
38	4
39	6
40	4
41	5
42	4
43	3
44	5
45	2
46	4
47	2
48	2
49	2
50	1
51	2
52	1
53	2
54	3
55	3
56	2
57	3
58	3
59	5
60	6
61	4
62	6
63	5
64	7
65	4
66	5
67	5
68	4
69	5
70	3
71	5
72	6
73	5
74	6
75	4
76	6
77	4
78	6
79	5
80	6

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

cp's OEIS Frontend

A239428 Number of ordered ways to write n = k + m with 0 < k <= m such that pi(2*k) - pi(k) and pi(2*m) - pi(m) are both prime, where pi(x) denotes the number of primes not exceeding x.

Table of values

List of values

A239428 Number of ordered ways to write n = k + m with 0 < k <= m such that pi(2k) - pi(k) and pi(2m) - pi(m) are both prime, where pi(x) denotes the number of primes not exceeding x.

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