A369055 - cp's OEIS frontend

A369055 Number of representations of 4n-1 as a sum (pq + pr + q*r) with three odd primes p <= q <= r.

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

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

cp's OEIS Frontend

A369055 Number of representations of 4n-1 as a sum (pq + pr + q*r) with three odd primes p <= q <= r.

Table of values

List of values

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

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

cp's OEIS Frontend

A369055 Number of representations of 4n-1 as a sum (p*q + p*r + q*r) with three odd primes p <= q <= r.

Table of values

List of values

A369055 Number of representations of 4n-1 as a sum (pq + pr + q*r) with three odd primes p <= q <= r.

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