|
Search: id:A035305
|
|
|
| A035305 |
|
Minimum sum of n numbers, any n-1 of which sum to a square. |
|
+0
1
|
|
| 5, 55, 122, 633, 911, 2210, 3156, 4908, 8656, 13018, 17426, 25968, 33135, 45374, 57128, 74543, 93673, 116973, 144454, 175564, 207031, 258150, 304708, 362466, 416117, 490029, 562590, 660993, 756963
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
REFERENCES
|
Haikin Fedor, unpublished (1998)
|
|
LINKS
|
S. R. Finch, Partition Problem
|
|
EXAMPLE
|
a(2)=5 because 5=1+4 and both 1 and 4 are squares; a(3)=55 because 55=6+19+30 and all three of 25=6+19, 36=6+30 and 49=19+30 are squares
|
|
CROSSREFS
|
Adjacent sequences: A035302 A035303 A035304 this_sequence A035306 A035307 A035308
Sequence in context: A085719 A129420 A015221 this_sequence A057722 A078216 A014700
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Erich Friedman (erich.friedman(AT)stetson.edu), S. R. Finch (Steven.Finch(AT)inria.fr)
|
|
|
Search completed in 0.002 seconds
|
