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.

A050793 Consider the Diophantine equation x^3 + y^3 = z^3 + 1 (1 or 'Fermat near misses'. Arrange solutions by increasing values of z (see A050791), and increasing values of y in case of ties. Sequence gives values of y.

Table of values

n a(n)
1 10
2 94
3 144
4 235
5 438
6 729
7 1537
8 1738
9 1897
10 2304
11 3518
12 4528
13 5625
14 8343
15 9036
16 9735
17 11664
18 11468
19 19386
20 21609
21 31180
22 35442
23 36864
24 33412
25 38782
26 35385
27 41167
28 44521
29 51762
30 59049
31 50920
32 72629
33 76903
34 83692
35 67402
36 80020
37 90000

List of values

[10, 94, 144, 235, 438, 729, 1537, 1738, 1897, 2304, 3518, 4528, 5625, 8343, 9036, 9735, 11664, 11468, 19386, 21609, 31180, 35442, 36864, 33412, 38782, 35385, 41167, 44521, 51762, 59049, 50920, 72629, 76903, 83692, 67402, 80020, 90000]