login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Smallest integer m > n such that both n*m and (n+1)*(m+1) are squares.
0

%I #20 Apr 14 2013 15:12:52

%S 3,49,242,48,1444,2645,4374,6727,288,13689,18490,24299,31212,39325,

%T 48734,960,71824,85697,101250,118579,137780,158949,182182,207575,2400,

%U 265225,297674,332667,370300,410669,453870,499999,549152,601425,656914,5040,777924,843637,912950,985959,1062760,1143449,1228122,1316875,1409804,1507005,1608574,1714607,675,1681,2060450

%N Smallest integer m > n such that both n*m and (n+1)*(m+1) are squares.

%C a(n) <= n*(4*n+3)^2.

%K nonn

%O 0,1

%A _Max Alekseyev_, Apr 14 2013