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.

A099806 If a,b are prime numbers satisfying the Diophantine equation a^3+b^3=c^2, then a is -1 mod 12 and b is 1 mod 12, or vice versa. Choose 'a' to be -1 mod 12. This is the sequence of 'a' values, sorted by the magnitude of c.

Table of values

n a(n)
0 11
1 8663
2 28703
3 56999
4 44111
5 86291
6 87959
7 16931
8 246011
9 54083
10 367823
11 552011
12 457511
13 571019
14 765983
15 1586531
16 1915163
17 2437751
18 16139
19 2305883
20 4074743
21 3963299
22 1296563
23 5440991
24 4683779
25 2238023
26 9682703
27 8681639
28 8142803

List of values

[11, 8663, 28703, 56999, 44111, 86291, 87959, 16931, 246011, 54083, 367823, 552011, 457511, 571019, 765983, 1586531, 1915163, 2437751, 16139, 2305883, 4074743, 3963299, 1296563, 5440991, 4683779, 2238023, 9682703, 8681639, 8142803]