id:A018928 - OEIS Search Results

Search: id:A018928

Displaying 1-1 of 1 results found.

page 1

Define {b(n)} by b(1)=3, b(n) (n >= 2) is smallest number such that b(1)^2+...+b(n)^2 = m^2 for some m and all b(i) are distinct. Sequence gives values of m.

+0
3

3, 5, 13, 85, 157, 12325, 12461, 106285, 276341, 339709, 10363909, 17238541, 1936511509, 51335823965, 133473142309, 872709007405, 1574530008629, 667511933218429, 698925273030725, 707670964169285, 1839944506840141 (list; graph; listen)

	OFFSET	`1,1`
	CROSSREFS	`Cf. A018929, A018930.` `Sequence in context: A066141 A159293 A051901 this_sequence A053630 A155012 A121533` `Adjacent sequences: A018925 A018926 A018927 this_sequence A018929 A018930 A018931`
	KEYWORD	`nonn`
	AUTHOR	`charles.reed(AT)bbs.ewgateway.org (Charles Reed)`
	EXTENSIONS	`More terms from David W. Wilson (davidwwilson(AT)comcast.net).`

page 1

Search completed in 0.002 seconds

Last modified December 8 08:31 EST 2009. Contains 170430 sequences.

AT&T Labs Research