Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115040
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115040 Minimum largest of a set of n distinct positive integers such that the sum of any pair is a square. +0
1
3, 30, 3362, 763442 (list; graph; listen)
OFFSET

2,1

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: A065753 A113677 A012008 this_sequence A065594 A145385 A059232

Adjacent sequences: A115037 A115038 A115039 this_sequence A115041 A115042 A115043

KEYWORD

more,nonn

AUTHOR

William Rex Marshall (w.r.marshall(AT)actrix.co.nz), Feb 26 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research