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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A115040 Minimum largest of a set of n distinct positive integers such that the sum of any pair is a square. 3
 3, 30, 3362, 763442 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS a(6) > 10^9. - Lars Blomberg, Oct 29 2014 LINKS Table of n, a(n) for n=2..5. Michael Winckler, Puzzle 051 [Cached copy at the Wayback Machine] Michael Winckler, Solution to Puzzle No. 051 [Cached copy at the Wayback Machine] EXAMPLE a(2) = 3: {1, 3}, a(3) = 30: {6, 19, 30}, a(4) = 3362: {2, 359, 482, 3362}, a(5) = 763442: {7442, 28658, 148583, 177458, 763442}. CROSSREFS Cf. A195854, A292158. Sequence in context: A208789 A296173 A248728 * A296409 A296407 A308383 Adjacent sequences: A115037 A115038 A115039 * A115041 A115042 A115043 KEYWORD nonn,nice,hard,more AUTHOR William Rex Marshall, Feb 26 2006 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 September 27 20:41 EDT 2023. Contains 365714 sequences. (Running on oeis4.)