A103413 - OEIS

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

%I #3 Mar 30 2012 17:29:22

%S 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,

%T 29,32,36,34,35,35,35,36,38,38,39,40,45,42,45,44,44,48,48,49,53,49,51,

%U 53,56,58,56,57,59,62,63,59,64,64,68,65,65,70,69,69,76,76,71,75,75,80,73

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

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

%K nonn

%O 1,2

%A _Ray Chandler_, Feb 04 2005