login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 1
2, 3, 13, 89, 809, 349, 409, 144541, 10446133981, 1361264878245241, 4398505263882824939701, 17847523009215848981, 512996953133650208042047593649109478833 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
Sebastian F. Orellana, Table of n, a(n) for n = 1..15
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 *)
CROSSREFS
Sequence in context: A212433 A013167 A224239 * A068096 A098462 A125283
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)