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).

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).

Terms

    a(0) =1a(1) =2a(2) =3a(3) =2a(4) =3a(5) =3a(6) =3a(7) =4a(8) =4a(9) =4a(10) =4a(11) =6a(12) =3a(13) =5a(14) =5a(15) =6a(16) =4a(17) =6a(18) =5a(19) =6a(20) =7a(21) =4a(22) =5a(23) =6a(24) =5a(25) =7a(26) =9a(27) =7a(28) =6a(29) =6

External references