login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078173 Max[min(r,s,t)], where the maximum is taken over all positive integer solutions of the Diophantine equation rst=n(r+s+t). 0
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
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.
LINKS
CROSSREFS
Cf. A063520.
Sequence in context: A272979 A357610 A102351 * A248005 A129759 A137467
KEYWORD
nonn
AUTHOR
John W. Layman, Nov 20 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 07:07 EDT 2024. Contains 371964 sequences. (Running on oeis4.)