A191004 - cp's OEIS frontend

A191004 Number of ways to write n = p+q+(n mod 2)q, where p is an odd prime and q<=n/2 is a prime such that JacobiSymbol[q,n]=1 if n is odd, and JacobiSymbol[(q+1)/2,n+1]=1 if n is even.

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

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

cp's OEIS Frontend

A191004 Number of ways to write n = p+q+(n mod 2)q, where p is an odd prime and q<=n/2 is a prime such that JacobiSymbol[q,n]=1 if n is odd, and JacobiSymbol[(q+1)/2,n+1]=1 if n is even.

Table of values

List of values

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

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

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