A018937 Let S be the smallest square that is the sum of n distinct positive integers. Then a(n) is the smallest k such that there exist n distinct positive integers <= k whose squares sum to S.

1, 4, 6, 6, 7, 9, 9, 11, 11, 13, 12, 16, 15, 16, 20, 21, 19, 22, 22, 22, 23, 25, 28, 24, 26, 29, 32, 36, 34, 33, 34, 35, 36, 38, 38, 39, 40, 45, 42, 44, 44, 44, 48, 48, 49, 50, 49, 51, 52, 54, 57, 56, 57, 56, 61, 63, 59, 61, 64, 64, 65, 65, 69, 67, 69, 76, 76, 71, 75, 73, 80, 73

Offset

1,2

Links

Table of n, a(n) for n=1..72.

Crossrefs

Cf. A018935, A018936, A103411, A103412, A103413, A103414.

Sequence in context: A205847 A227967 A292672 * A103413 A103412 A103411

Adjacent sequences: A018934 A018935 A018936 * A018938 A018939 A018940

Keyword

nonn

Author

N. J. A. Sloane

Extensions

Corrected and extended by David W. Wilson

Name edited by Jon E. Schoenfield, Sep 30 2023

Status

approved