Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A100253
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A100253 Let j be the smallest integer for which 1+(1+1*n)+(1+2*n)+...+(1+j*n)=k^2=s. Then a(n)=1+j*n; if no such j exists, then a(n)=0. +0
4
8, 3, 241, 97, 26, 49, 8, 0, 55, 31, 23, 97, 274, 15, 721, 49, 120, 0, 305, 161, 1681, 89, 24, 577, 1126, 53, 244, 3361, 146, 241, 528, 97, 991, 35, 351, 6049, 223, 191, 65521, 1921, 288, 127, 213281, 485, 10081, 323, 48, 721, 1520, 0, 2449 (list; graph; listen)
OFFSET

1,1

COMMENT

Basis for sequence is shortest arithmetic series with initial term 1 and difference n that sums to a perfect square.

FORMULA

1+(1+1*n)+(1+2*n)+...+(1+A100254(n)*n)= 1+(1+1*n)+(1+2*n)+...+a(n)=A100251(n)^2=A100252(n)

EXAMPLE

a(3)=241 since 1 + 4 + 7 +...+ 241 = 99^2 = 9801 and no other arithmetic series with initial term 1, difference 3 and fewer terms sums to a perfect square.

CROSSREFS

Sequence in context: A049074 A038281 A131502 this_sequence A088397 A021123 A114313

Adjacent sequences: A100250 A100251 A100252 this_sequence A100254 A100255 A100256

KEYWORD

nonn

AUTHOR

Charlie Marion (charliemath(AT)optonline.net), Nov 21 2004

page 1

Search completed in 0.003 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

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


AT&T Labs Research