A103413 - OEIS

The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

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}.

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 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,2`
	LINKS	`Table of n, a(n) for n=1..72.`
	CROSSREFS	`Cf. A018935, A018936, A018937, A103411, A103412, A103414.` `Sequence in context: A227967 A292672 A018937 * A103412 A103411 A200118` `Adjacent sequences: A103410 A103411 A103412 * A103414 A103415 A103416`
	KEYWORD	`nonn`
	AUTHOR	`Ray Chandler, Feb 04 2005`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 16 15:53 EST 2021. Contains 340206 sequences. (Running on oeis4.)