This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A101160 #28 Oct 06 2023 10:59:35
%S A101160 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,
%T A101160 54,56,58,60,8,64,66,5,0,7,74,10,1,80,82,4,86,8,12,2,94,0,98,100,17,
%U A101160 14,106,108,110,7,9,116,1,120,23,124,0,128
%N A101160 a(n) is the smallest integer j for which n+(n+1)+...+(n+j) is a square.
%C A101160 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.
%C A101160 0 <= a(n) <= 2*(n - 1). - _Ctibor O. Zizka_, Oct 05 2023
%H A101160 Shawn A. Broyles, <a href="/A101160/b101160.txt">Table of n, a(n) for n = 1..1000</a>
%F A101160 n+(n+1)+...+(n+a(n)) = n+(n+1)+...+A101159(n) = A101157(n)^2 = A101158(n).
%F A101160 a(n^2) = 0. - _Michel Marcus_, Jun 28 2013
%e A101160 a(11)=2 since j=2 is the smallest integer for which 11+...+11+j = 6^2 = 36 is a perfect square.
%o A101160 (PARI) a(n) = {j = 0; while(! issquare(sum(k=0, j, n+k)), j++); j;} \\ _Michel Marcus_, Sep 01 2013
%Y A101160 Cf. A101157, A101158, A101159.
%Y A101160 Cf. A100251, A100252, A100253, A100254.
%K A101160 nonn
%O A101160 1,2
%A A101160 _Charlie Marion_, Dec 29 2004
%E A101160 More terms from _Michel Marcus_, Jun 28 2013