login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A101158 Let j be the smallest integer for which n+(n+1)+...+(n+j) is a square; sequence gives the squares. 4

%I #21 May 02 2018 10:15:52

%S 1,9,25,4,81,121,169,225,9,361,36,25,625,729,841,16,1089,100,1369,

%T 1521,196,1849,2025,49,25,81,2809,3025,3249,3481,3721,324,4225,4489,

%U 225,36,324,5625,484,81,6561,6889,225,7569,441,676,144,9025,49,9801

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

%C Basis for sequence is shortest arithmetic sequence with initial term n and difference 1 that sums to a perfect square. Cf. A100251, A100252, A100253, A100254.

%H Shawn A. Broyles, <a href="/A101158/b101158.txt">Table of n, a(n) for n = 1..1000</a>

%F n+(n+1)+...+(n+A101160(n)) = n+(n+1)+...+A101159(n) = A101157(n)^2 = a(n).

%F a(n^2) = n^2. - _Michel Marcus_, Jun 28 2013

%e a(11)=36 since 11+12+13 = 36.

%Y Cf. A101157, A101159, A101160.

%K nonn

%O 1,2

%A _Charlie Marion_, Dec 29 2004

%E a(21) corrected by _Michel Marcus_, Jun 29 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:14 EDT 2024. Contains 371918 sequences. (Running on oeis4.)