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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A035305 Minimum sum of n distinct positive numbers, any n-1 of which sum to a square. 1
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; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Haikin Fedor, Table for partition problem (1998)
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
Sequence in context: A216446 A307991 A015221 * A292455 A292735 A057722
KEYWORD
nonn,nice
AUTHOR
EXTENSIONS
Link edited by N. J. A. Sloane, Jan 26 2009 at the suggestion of Steven Finch.
a(1)=1 prepended by Max Alekseyev, May 21 2022
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 06:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)