A078173 a(n) = max(min(r,s,t)), where the maximum is taken over all positive integer solutions of the Diophantine equation r*s*t = n * (r+s+t).

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, 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, 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

Offset: 1

Author

John W. Layman, Nov 20 2002

Keywords

• nonn

Comments

Conjecture: max(t) = n*(n+2) and max(s) = 2*n, where the maxima are taken over all positive integer solutions r<=s<=t of the above Diophantine equation.

Crossrefs

Cf. A063520.