id:A101157 - OEIS Search Results

Search: id:A101157

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, say k^2; then a(n)=k.

+0
4

1, 3, 5, 2, 9, 11, 13, 15, 3, 19, 6, 5, 25, 27, 29, 4, 33, 10, 37, 39, 8, 43, 45, 7, 5, 9, 53, 55, 57, 59, 61, 18, 65, 67, 15, 6, 18, 75, 22, 9, 81, 83, 15, 87, 21, 26, 12, 95, 7, 99 (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)=6 since 11+12+13=6^2`
	CROSSREFS	`Cf. A101158-A101160.` `Sequence in context: A026212 A057033 A003574 this_sequence A077952 A077975 A112323` `Adjacent sequences: A101154 A101155 A101156 this_sequence A101158 A101159 A101160`
	KEYWORD	`nonn`
	AUTHOR	`Charlie Marion (charliemath(AT)optonline.net), Dec 29 2004`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research