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.

A356717 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+3) + (-1)^n * F(n-2) and F(n) is the n-th Fibonacci number (A000045).

Table of values

n a(n)
1 1
2 29
3 59
4 241
5 445
6 1691
7 3089
8 11629
9 21211
10 79745
11 145421
12 546619
13 996769
14 3746621
15 6831995
16 25679761
17 46827229
18 176011739
19 320958641
20 1206402445
21 2199883291
22 8268805409
23 15078224429
24 56675235451
25 103347687745
26 388457842781
27 708355589819
28 2662529664049

List of values

[1, 29, 59, 241, 445, 1691, 3089, 11629, 21211, 79745, 145421, 546619, 996769, 3746621, 6831995, 25679761, 46827229, 176011739, 320958641, 1206402445, 2199883291, 8268805409, 15078224429, 56675235451, 103347687745, 388457842781, 708355589819, 2662529664049]