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.

A050792 Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791). Sequence gives values of x.

Table of values

n a(n)
1 9
2 64
3 73
4 135
5 334
6 244
7 368
8 1033
9 1010
10 577
11 3097
12 3753
13 1126
14 4083
15 5856
16 3987
17 1945
18 11161
19 13294
20 3088
21 10876
22 16617
23 4609
24 27238
25 5700
26 27784
27 11767
28 26914
29 38305
30 6562
31 49193
32 27835
33 35131
34 7364
35 65601
36 50313
37 9001
38 11980
39 39892
40 20848

List of values

[9, 64, 73, 135, 334, 244, 368, 1033, 1010, 577, 3097, 3753, 1126, 4083, 5856, 3987, 1945, 11161, 13294, 3088, 10876, 16617, 4609, 27238, 5700, 27784, 11767, 26914, 38305, 6562, 49193, 27835, 35131, 7364, 65601, 50313, 9001, 11980, 39892, 20848]