A103412 -id:A103412 - cp's OEIS frontend

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

N. J. A. Sloane

nonn

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

Corrected and extended by David W. Wilson

Name edited by Jon E. Schoenfield, Sep 30 2023

A103411 Consider smallest m such that m^2 = x_1^2 + ... + x_n^2 with 0 < x_1 < ... < x_n. Sequence gives greatest value of x_n.

Original entry on oeis.org

1, 4, 6, 6, 7, 9, 9, 11, 11, 15, 12, 17, 15, 16, 20, 21, 23, 22, 22, 30, 23, 25, 28, 24, 26, 34, 32, 36, 36, 43, 35, 35, 36, 38, 38, 39, 44, 45, 42, 45, 50, 44, 48, 48, 49, 53, 49, 51, 53, 64, 58, 56, 57, 65, 62, 63, 65, 64, 64, 68, 65, 65, 70, 69, 69, 76, 76, 79, 75, 75, 80, 73

Offset: 1

Ray Chandler, Feb 04 2005

nonn

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

A103413 Consider smallest m such that m^2 = x_1^2 + ... + x_n^2 with 0 < x_1 < ... < x_n. Sequence gives value of x_n for lexicographically greatest {x_1,...,x_n}.

Original entry on oeis.org

1, 4, 6, 6, 7, 9, 9, 11, 11, 13, 12, 17, 15, 16, 20, 21, 19, 22, 22, 22, 23, 25, 28, 24, 26, 29, 32, 36, 34, 35, 35, 35, 36, 38, 38, 39, 40, 45, 42, 45, 44, 44, 48, 48, 49, 53, 49, 51, 53, 56, 58, 56, 57, 59, 62, 63, 59, 64, 64, 68, 65, 65, 70, 69, 69, 76, 76, 71, 75, 75, 80, 73

Offset: 1

Ray Chandler, Feb 04 2005

nonn

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

A103414 Consider smallest m such that m^2 = x_1^2 + ... + x_n^2 with 0 < x_1 < ... < x_n. Sequence gives number of solutions {x_1,...,x_n}.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 1, 4, 1, 1, 1, 1, 1, 3, 1, 1, 3, 5, 2, 1, 1, 1, 1, 1, 3, 1, 1, 2, 2, 1, 1, 1, 1, 3, 1, 1, 2, 5, 3, 1, 1, 3, 2, 1, 3, 5, 1, 6, 1, 1, 2, 2, 2, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 3, 2, 5, 1, 3, 10, 4, 9, 1, 1, 1, 1, 5, 5, 4, 6, 9, 1, 4, 1, 1, 2, 1, 1, 2, 1, 9

Offset: 1

Ray Chandler, Feb 04 2005

nonn

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

cp's OEIS Frontend

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.

Views

Author

Keywords

Crossrefs

Extensions

A103411 Consider smallest m such that m^2 = x_1^2 + ... + x_n^2 with 0 < x_1 < ... < x_n. Sequence gives greatest value of x_n.

Views

Author

Keywords

Crossrefs

A103413 Consider smallest m such that m^2 = x_1^2 + ... + x_n^2 with 0 < x_1 < ... < x_n. Sequence gives value of x_n for lexicographically greatest {x_1,...,x_n}.

Views

Author

Keywords

Crossrefs

A103414 Consider smallest m such that m^2 = x_1^2 + ... + x_n^2 with 0 < x_1 < ... < x_n. Sequence gives number of solutions {x_1,...,x_n}.

Views

Author

Keywords

Crossrefs