A385565 - cp's OEIS frontend

A385565 a(n) is the smallest positive integer k such that the Diophantine equation x^3 + y^3 + z^3 = k^4, where 0 < x < y < z has exactly n integer solutions.

n	a(n)
1	11
2	21
3	64
4	144
5	330
6	846
7	342
8	252
9	1331
10	1008
11	720
12	1890
13	3780
14	729
15	4200
16	2016
17	1000
18	216
19	6300
20	8352
21	10800
22	12312
23	8568
24	19440
25	8280
26	9576
27	21204

[11, 21, 64, 144, 330, 846, 342, 252, 1331, 1008, 720, 1890, 3780, 729, 4200, 2016, 1000, 216, 6300, 8352, 10800, 12312, 8568, 19440, 8280, 9576, 21204]

cp's OEIS Frontend

A385565 a(n) is the smallest positive integer k such that the Diophantine equation x^3 + y^3 + z^3 = k^4, where 0 < x < y < z has exactly n integer solutions.

Table of values

List of values