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.

A356716 a(n) is the integer w such that (c(n)^2, -d(n)^2, -w) is a primitive solution to the Diophantine equation 2*x^3 + 2*y^3 + z^3 = 11^3, where c(n) = F(n+2) + (-1)^n * F(n-3), d(n) = F(n+1) + (-1)^n * F(n-4) and F(n) is the n-th Fibonacci number (A000045).

Table of values

n a(n)
1 5
2 19
3 31
4 101
5 179
6 655
7 1189
8 4451
9 8111
10 30469
11 55555
12 208799
13 380741
14 1431091
15 2609599
16 9808805
17 17886419
18 67230511
19 122595301
20 460804739
21 840280655
22 3158402629
23 5759369251
24 21648013631
25 39475304069
26 148377692755
27 270567759199
28 1016995835621
29 1854499010291

List of values

[5, 19, 31, 101, 179, 655, 1189, 4451, 8111, 30469, 55555, 208799, 380741, 1431091, 2609599, 9808805, 17886419, 67230511, 122595301, 460804739, 840280655, 3158402629, 5759369251, 21648013631, 39475304069, 148377692755, 270567759199, 1016995835621, 1854499010291]