id:A103411 - OEIS Search Results

Search: id:A103411

Displaying 1-1 of 1 results found.

page 1

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.

+0
5

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 (list; graph; listen)

	OFFSET	`1,2`
	CROSSREFS	`Cf. A018935, A018936, A018937, A103412, A103413, A103414.` `Sequence in context: A018937 A103413 A103412 this_sequence A074672 A070259 A111653` `Adjacent sequences: A103408 A103409 A103410 this_sequence A103412 A103413 A103414`
	KEYWORD	`nonn`
	AUTHOR	`Ray Chandler (rayjchandler(AT)sbcglobal.net), Feb 04 2005`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research