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.

A361520 a(n) is the greatest prime factor of a(n-2)^2 + a(n-1)^2 where a(1)=2 and a(2)=3.

Original entry on oeis.org

2, 3, 13, 89, 809, 349, 409, 144541, 10446133981, 1361264878245241, 4398505263882824939701, 17847523009215848981, 512996953133650208042047593649109478833
Offset: 1

Views

Author

Sebastian F. Orellana, Mar 14 2023

Keywords

Crossrefs

Programs

  • Maple
    A[1]:= 2: A[2]:= 3:
    for n from 3 to 15 do A[n]:= max(numtheory:-factorset(A[n-2]^2 + A[n-1]^2)) od:
    seq(A[],n=1..15); # Robert Israel, Mar 17 2023
  • Mathematica
    a[1] = 2; a[2] = 3; a[n_] := a[n] = FactorInteger[a[n - 1]^2 + a[n - 2]^2][[-1, 1]]; Array[a, 14] (* Amiram Eldar, Mar 14 2023 *)