Let a(1)=3; for n > 1, let a(n) be the least positive integer k such that k > a(n-1), a(1)^2 + ... + a(n-1)^2 + k^2 is a square and the Pythagorean triple sqrt(a(1)^2 + ... + a(n-1)^2), a(n), sqrt(a(1)^2 + ... + a(n)^2) is primitive.
A307077
Let a(1)=3; for n > 1, let a(n) be the least positive integer k such that k > a(n-1), a(1)^2 + ... + a(n-1)^2 + k^2 is a square and the Pythagorean triple sqrt(a(1)^2 + ... + a(n-1)^2), a(n), sqrt(a(1)^2 + ... + a(n)^2) is primitive.
Terms
- a(0) =3a(1) =4a(2) =12a(3) =84a(4) =132a(5) =12324a(6) =89892a(7) =2447844a(8) =28350372a(9) =295742791596
External references
- oeis: A307077