id:A101158 - OEIS Search Results

Search: id:A101158

Displaying 1-1 of 1 results found.

page 1

Let j be the smallest integer for which n+(n+1)+...+(n+j) is a square; sequence gives the squares.

+0
4

1, 9, 25, 4, 81, 121, 169, 225, 9, 361, 36, 25, 625, 729, 841, 16, 1089, 100, 1369, 1521, 64, 1849, 2025, 49, 25, 81, 2809, 3025, 3249, 3481, 3721, 324, 4225, 4489, 225, 36, 324, 5625, 484, 81, 6561, 6889, 225, 7569, 441, 676, 144, 9025, 49, 9801 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Basis for sequence is shortest arithmetic sequence with initial term n and difference 1 that sums to a perfect square. Cf. A100251-A100254.`
	FORMULA	`n+(n+1)+...+(n+A101160(n))=n+(n+1)+...+A101159(n)= A101157(n)^2=A101158(n)`
	EXAMPLE	`a(11)=36 since 11+12+13 =36`
	CROSSREFS	`Cf. A101157-A101160.` `Adjacent sequences: A101155 A101156 A101157 this_sequence A101159 A101160 A101161` `Sequence in context: A121089 A050282 A096757 this_sequence A113496 A086531 A089091`
	KEYWORD	`nonn`
	AUTHOR	`Charlie Marion (charliemath(AT)optonline.net), Dec 29 2004`

page 1

Search completed in 0.002 seconds

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.

AT&T Labs Research