A369460 - cp's OEIS frontend

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

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

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

cp's OEIS Frontend

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

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

cp's OEIS Frontend

A369460 Number of representations of 12n-9 as a sum (p*q + p*r + q*r) with three odd primes p <= q <= r.

Table of values

List of values

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

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