A290399 - cp's OEIS frontend

A290399 Number of solutions to Diophantine equation x + y + z = prime(n) with xyz = k^3 (0 < x <= y <= z).

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

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

cp's OEIS Frontend

A290399 Number of solutions to Diophantine equation x + y + z = prime(n) with xyz = k^3 (0 < x <= y <= z).

Table of values

List of values

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

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

cp's OEIS Frontend

A290399 Number of solutions to Diophantine equation x + y + z = prime(n) with x*y*z = k^3 (0 < x <= y <= z).

Table of values

List of values

A290399 Number of solutions to Diophantine equation x + y + z = prime(n) with xyz = k^3 (0 < x <= y <= z).

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