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.

A385323 a(n) is the smallest prime p for which the Diophantine equation Sum_{i=1..n} (x_i)^3 = p^3 has a solution, where (x_i), i=1..n, is a strictly increasing sequence of positive integers, or -1 if no such prime exists.

Table of values

n a(n)
1 2
2 -1
3 19
4 13
5 17
6 13
7 17
8 17
9 19
10 19
11 23
12 23
13 29
14 29
15 29
16 31
17 37
18 37
19 41
20 41
21 43
22 47
23 53
24 53
25 53
26 59
27 59
28 59
29 67
30 67
31 67
32 71
33 71
34 79
35 79
36 79
37 83
38 89
39 89
40 97

List of values

[2, -1, 19, 13, 17, 13, 17, 17, 19, 19, 23, 23, 29, 29, 29, 31, 37, 37, 41, 41, 43, 47, 53, 53, 53, 59, 59, 59, 67, 67, 67, 71, 71, 79, 79, 79, 83, 89, 89, 97]