login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
2,1
COMMENTS
a(6) > 10^9. - Lars Blomberg, Oct 29 2014
LINKS
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
Sequence in context: A208789 A296173 A248728 * A296409 A296407 A375530
KEYWORD
nonn,nice,hard,more
AUTHOR
STATUS
approved