|
|
COMMENTS
| Contribution from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Oct 23 2010: (Start)
Writing x=(-1+sqrt( 1+4*n*t*(t+1))/2, each solution is associated with a diophantine equation 1+4*n*t*(t+1)=s^2. The sequence entries are the leading column if all solutions are presented in rows for a given n:
3,20,119,696,4059, A001652 (n=2)
2,9,35,132,494,1845,6887, A001571 (n=3)
... (n=4)
5,14,99,260,1785,4674, A077262 (n=5)
3,8,35,84,351,836,3479,8280, A077291 (n=6)
6,14,104,231,1665,3689, A077401 (n=7)
15,32,527,1104,17919, (n=8)
... (n=9)
4,20,39,175,779,1500,6664,29600, (n=10)
11,21,230,429,4598,8568, (n=11)
8,15,119,216,1664,3015,23183, (n=12)
12,77,845,1494,16302, (n=13)
20,35,615,1064,18444,31899, (n=14)
5,9,44,75,350,594,2759,4680,21725,36849, (n=15)
.... (n=16)
51,84,3399,5576, (n=17)
27,44,935,1512,31779, (n=18)
19,285,455,6649, (n=19)
15,24,279,440,5015,7904, (n=20)
(End)
|
