cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A383877 a(n) is the smallest integer k such that the Diophantine equation x^3 + y^3 + z^3 + w^3 = k^3, where 0 < x < y < z < w has exactly n integer solutions, or 0 if there is no such k.

Table of values

n a(n)
1 14
2 13
3 55
4 26
5 52
6 63
7 70
8 66
9 56
10 104
11 102
12 143
13 161
14 91
15 117
16 112
17 78
18 236
19 180
20 217
21 198
22 192
23 140
24 292
25 216
26 259
27 156
28 196
29 344
30 168
31 210
32 264
33 325
34 252
35 406
36 360
37 380
38 402
39 315
40 338
41 234
42 308
43 351
44 182
45 396
46 408
47 399
48 432
49 441
50 312
51 474
52 636
53 513
54 273
55 336
56 476
57 618
58 666

List of values

[14, 13, 55, 26, 52, 63, 70, 66, 56, 104, 102, 143, 161, 91, 117, 112, 78, 236, 180, 217, 198, 192, 140, 292, 216, 259, 156, 196, 344, 168, 210, 264, 325, 252, 406, 360, 380, 402, 315, 338, 234, 308, 351, 182, 396, 408, 399, 432, 441, 312, 474, 636, 513, 273, 336, 476, 618, 666]