id:A101160 - OEIS Search Results

Search: id:A101160

Displaying 1-1 of 1 results found.

page 1

a(n) = the smallest integer j for which n+(n+1)+...+(n+j) is a square.

+0
4

0, 2, 4, 0, 8, 10, 12, 14, 0, 18, 2, 1, 24, 26, 28, 0, 32, 4, 36, 38, 7, 42, 44, 1, 0, 2, 52, 54, 56, 58, 60, 8, 64, 66, 5, 0, 7, 74, 10, 1, 80, 82, 4, 86, 8, 12, 2, 94, 0, 98 (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)=2 since j=2 is the smallest integer for which 11+...+11+j=6^2=36 is a perfect square`
	CROSSREFS	`Cf. A101157-A101159.` `Sequence in context: A137511 A011166 A115341 this_sequence A103191 A071607 A095059` `Adjacent sequences: A101157 A101158 A101159 this_sequence A101161 A101162 A101163`
	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