A369462 - cp's OEIS frontend

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

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

cp's OEIS Frontend

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

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

cp's OEIS Frontend

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

Table of values

List of values

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