A060829 - cp's OEIS frontend

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.

n	a(n)
0	5
1	17
2	13
3	37
4	65
5	29
6	101
7	25
8	145
9	53
10	197
11	257
12	85
13	325
14	41
15	401
16	125
17	485
18	73
19	577
20	173
21	677
22	65
23	785
24	61
25	109
26	229
27	901
28	1025
29	293
30	1157
31	97
32	1297
33	365
34	1445
35	89
36	1601
37	85
38	205
39	445
40	1765
41	137
42	1937
43	533
44	2117
45	265
46	2305
47	629
48	2501
49	185
50	2705
51	733
52	2917

[5, 17, 13, 37, 65, 29, 101, 25, 145, 53, 197, 257, 85, 325, 41, 401, 125, 485, 73, 577, 173, 677, 65, 785, 61, 109, 229, 901, 1025, 293, 1157, 97, 1297, 365, 1445, 89, 1601, 85, 205, 445, 1765, 137, 1937, 533, 2117, 265, 2305, 629, 2501, 185, 2705, 733, 2917]

cp's OEIS Frontend

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.

Table of values

List of values