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.

A354337 a(n) is the integer w such that (L(2*n)^2, -L(2*n + 1)^2, w) is a primitive solution to the Diophantine equation 2*x^3 + 2*y^3 + z^3 = 125, where L(n) is the n-th Lucas number (A000032).

Original entry on oeis.org

19, 149, 1039, 7139, 48949, 335519, 2299699, 15762389, 108037039, 740496899, 5075441269, 34787591999, 238437702739, 1634276327189, 11201496587599, 76776199786019, 526231901914549, 3606847113615839, 24721697893396339, 169445038140158549, 1161393569087713519
Offset: 1

Views

Author

XU Pingya, Jun 20 2022

Keywords

Comments

Subsequence of A017377.

Examples

			2*(L(4)^2)^3 + 2*(-L(5)^2)^3 + (149)^3 = 2*(49)^3 + 2*(-121)^3 + (149)^3 = 125, a(2) = 149.
		

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{7,-1},{19,149},21]-1 + LucasL[2*Range[21]-3]^2

Formula

a(n) = (125 - 2*A005248(n)^6 + 2*A002878(n)^6)^(1/3).
a(n) = Lucas(4*n+2) + Lucas(4n-1) - 3 = 2*A056914(n)-3 = 15*A092521(n) + A288913(n-1).
a(n) = 2*A081017(n) - 1.
a(n) = 10*A089508(n) + 9.
a(n) = 8*a(n-1) - 8*a(n-2) + a(n-3).
G.f.: x*(19 - 3*x - x^2)/((1 - x)*(1 - 7*x + x^2)). - Stefano Spezia, Jun 22 2022