Let j be the smallest integer for which 1 + (1+1*n) + (1+2*n) + ... + (1+j*n) = k^2 = s. Then a(n)=j; if no such j exists, then a(n)=0.

A100254

Let j be the smallest integer for which 1 + (1+1*n) + (1+2*n) + ... + (1+j*n) = k^2 = s. Then a(n)=j; if no such j exists, then a(n)=0.

Terms

    a(0) =7a(1) =1a(2) =80a(3) =24a(4) =5a(5) =8a(6) =1a(7) =0a(8) =6a(9) =3a(10) =2a(11) =8a(12) =21a(13) =1a(14) =48a(15) =3a(16) =7a(17) =0a(18) =16a(19) =8a(20) =80a(21) =4a(22) =1a(23) =24a(24) =45a(25) =2a(26) =9a(27) =120a(28) =5a(29) =8

External references