A385409 - cp's OEIS frontend

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

n	a(n)
1	10
2	42
3	39
4	153
5	126
6	276
7	273
8	312
9	315
10	476
11	588
12	336
13	546
14	777
15	1053
16	756
17	1216
18	1386
19	1560
20	1134
21	1323
22	1488
23	1365
24	1368
25	1344
26	1596
27	2366
28	2496
29	2988
30	1680
31	2548
32	1736
33	2184
34	3003
35	3720
36	2520
37	3185
38	3552
39	2268
40	3564
41	4095
42	3213
43	4578
44	4392
45	5208
46	4004
47	4599
48	5733

[10, 42, 39, 153, 126, 276, 273, 312, 315, 476, 588, 336, 546, 777, 1053, 756, 1216, 1386, 1560, 1134, 1323, 1488, 1365, 1368, 1344, 1596, 2366, 2496, 2988, 1680, 2548, 1736, 2184, 3003, 3720, 2520, 3185, 3552, 2268, 3564, 4095, 3213, 4578, 4392, 5208, 4004, 4599, 5733]

cp's OEIS Frontend

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

Table of values

List of values