|
%I #9 Apr 21 2021 04:37:32
%S 1,2,3,2,3,3,3,4,4,4,4,6,3,5,5,6,4,6,5,6,7,4,5,6,5,7,9,7,6,6,5,8,9,6,
%T 8,8,3,8,9,10,7,7,5,10,9,7,7,12,7,10,9,9,7,10,11,12,9,6,7,10,7,8,11,
%U 12,13,11,5,11,9,10,9,12,5,8,15,10,12,12,9,12,12,7,8,14,15,11,11,12,10,15
%N Max[min(r,s,t)], where the maximum is taken over all positive integer solutions of the Diophantine equation rst=n(r+s+t).
%C Conjecture: Max[t]=n(n+2) and Max[s]=2n, where the maxima are taken over all positive integer solutions r<=s<=t of the above Diophantine equation.
%Y Cf. A063520.
%K nonn
%O 1,2
%A _John W. Layman_, Nov 20 2002
|
