A239430 - cp's OEIS frontend

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

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

cp's OEIS Frontend

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

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

cp's OEIS Frontend

A239430 Number of ways to write n = k + m with k > 0 and m > 0 such that pi(2*k) - pi(k) is prime and pi(2*m) - pi(m) is a square, where pi(x) denotes the number of primes not exceeding x.

Table of values

List of values

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