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.

A316359 a(n) is the number of solutions to the Diophantine equation i^3 + j^3 + k^3 = n^3, where 0 < i <= j <= k.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 1
7 0
8 0
9 1
10 0
11 0
12 1
13 0
14 0
15 0
16 0
17 0
18 2
19 1
20 1
21 0
22 0
23 0
24 1
25 1
26 0
27 1
28 1
29 1
30 1
31 0
32 0
33 0
34 0
35 0
36 2
37 0
38 1
39 0
40 1
41 2
42 1
43 0
44 1
45 1
46 2
47 0
48 1
49 0
50 1
51 0
52 0
53 1
54 3
55 0
56 1
57 1
58 2
59 0
60 2
61 0
62 0
63 1
64 0
65 0
66 1
67 1
68 0
69 1
70 1
71 1
72 3
73 0
74 0
75 2
76 2
77 0
78 1
79 0
80 1
81 2
82 3
83 0
84 3
85 1
86 0
87 4

List of values

[0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 2, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 2, 0, 1, 0, 1, 2, 1, 0, 1, 1, 2, 0, 1, 0, 1, 0, 0, 1, 3, 0, 1, 1, 2, 0, 2, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 3, 0, 0, 2, 2, 0, 1, 0, 1, 2, 3, 0, 3, 1, 0, 4]