A018937 -id:A018937 - cp's OEIS frontend

A018935 a(n) is the smallest m whose square is the sum of n distinct positive squares.

1, 5, 7, 9, 10, 13, 14, 17, 19, 23, 23, 30, 30, 34, 38, 41, 45, 48, 52, 59, 60, 64, 68, 70, 75, 83, 85, 91, 97, 102, 106, 109, 114, 120, 123, 130, 137, 140, 146, 152, 158, 161, 167, 175, 180, 187, 190, 196, 203, 211, 217, 223, 228, 236, 242, 248, 255, 261, 267, 275, 282, 288

Offset: 1

N. J. A. Sloane

nonn

Cf. A018936, A018937.

Corrected and extended by David W. Wilson

Name simplified by Jon E. Schoenfield, Sep 30 2023

A018936 a(n) is the smallest square that is the sum of n distinct positive squares.

Original entry on oeis.org

1, 25, 49, 81, 100, 169, 196, 289, 361, 529, 529, 900, 900, 1156, 1444, 1681, 2025, 2304, 2704, 3481, 3600, 4096, 4624, 4900, 5625, 6889, 7225, 8281, 9409, 10404, 11236, 11881, 12996, 14400, 15129, 16900, 18769, 19600, 21316, 23104, 24964, 25921, 27889

Offset: 1

N. J. A. Sloane

nonn

			a(3) = 49 = 36 + 9 + 4 is the smallest square which is the sum of three distinct positive squares.

Cf. A018935, A018937.

a(n) = A018935(n)^2. - Hugo Pfoertner, Sep 30 2023

Corrected and extended by David W. Wilson

Name simplified by Jon E. Schoenfield, Sep 29 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.

A103412 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 least {x_1,...,x_n}.

Original entry on oeis.org

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

Offset: 1

Ray Chandler, Feb 04 2005

nonn

Cf. A018935, A018936, A018937, A103411, 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

A018935 a(n) is the smallest m whose square is the sum of n distinct positive squares.

Views

Author

Keywords

Crossrefs

Extensions

A018936 a(n) is the smallest square that is the sum of n distinct positive squares.

Views

Author

Keywords

Examples

Crossrefs

Formula

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

A103412 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 least {x_1,...,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