For each y >= 1 there are only finitely many values of x >= 1 such that x-y and x+y are both squares; list all such pairs (x,y) with gcd(x,y) = 1 ordered by values of y; sequence gives x values.
A060829
For each y >= 1 there are only finitely many values of x >= 1 such that x-y and x+y are both squares; list all such pairs (x,y) with gcd(x,y) = 1 ordered by values of y; sequence gives x values.
Terms
- a(0) =5a(1) =17a(2) =13a(3) =37a(4) =65a(5) =29a(6) =101a(7) =25a(8) =145a(9) =53a(10) =197a(11) =257a(12) =85a(13) =325a(14) =41a(15) =401a(16) =125a(17) =485a(18) =73a(19) =577a(20) =173a(21) =677a(22) =65a(23) =785a(24) =61a(25) =109a(26) =229a(27) =901a(28) =1025a(29) =293
External references
- oeis: A060829