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

 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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A195898 Smallest possible largest number in a set of n integers such that the sum of any two numbers is a positive cube. 1
 1, 14, 70993724 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 COMMENTS Here, the smallest number is negative (since we need the smallest such largest number) and the remaining numbers are positive (since the condition is about positive cubes). LINKS Table of n, a(n) for n=2..4. Erich Friedman, Problem of the month October 2010 Andrzej Nowicki, Podroze po Imperium Liczb [broken link] EXAMPLE { -35780, 4693243, 11888132, 70993724 } is the smallest set of 4 numbers such that all 6 combinations of sum of any two numbers is a perfect cube. For example, -35780 + 70993724 = 414^3 and 4693243 + 11888132 = 255^3. { -13, 13, 14 } is the smallest set of 3 numbers where all 3 combinations of sum of any two numbers is a perfect cube. { -1, 1 } is the trivial set of two numbers because -1 + 1 = 0^3. CROSSREFS Cf. A000578, A195854, A195899. Sequence in context: A350891 A347626 A013870 * A263500 A164526 A278897 Adjacent sequences: A195895 A195896 A195897 * A195899 A195900 A195901 KEYWORD nonn,more,bref AUTHOR Kausthub Gudipati, Sep 25 2011 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.

Last modified December 7 18:04 EST 2023. Contains 367660 sequences. (Running on oeis4.)