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.

A337929 Numbers w such that (F(2*n-1)^2, -F(2*n)^2, w) are primitive solutions of the Diophantine equation 2*x^3 + 2*y^3 + z^3 = 1, where F(n) is the n-th Fibonacci number (A000045).

Table of values

n a(n)
1 1
2 11
3 79
4 545
5 3739
6 25631
7 175681
8 1204139
9 8253295
10 56568929
11 387729211
12 2657535551
13 18215019649
14 124847601995
15 855718194319
16 5865179758241
17 40200540113371
18 275538601035359
19 1888569667134145
20 12944449068903659
21 88722573815191471
22 608113567637436641

List of values

[1, 11, 79, 545, 3739, 25631, 175681, 1204139, 8253295, 56568929, 387729211, 2657535551, 18215019649, 124847601995, 855718194319, 5865179758241, 40200540113371, 275538601035359, 1888569667134145, 12944449068903659, 88722573815191471, 608113567637436641]