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 A055087 #21 Nov 24 2024 01:53:21
%S A055087 0,0,0,1,0,1,0,1,2,0,1,2,0,1,2,3,0,1,2,3,0,1,2,3,4,0,1,2,3,4,0,1,2,3,
%T A055087 4,5,0,1,2,3,4,5,0,1,2,3,4,5,6,0,1,2,3,4,5,6,0,1,2,3,4,5,6,7,0,1,2,3,
%U A055087 4,5,6,7,0,1,2,3,4,5,6,7,8,0,1,2,3,4,5,6,7,8,0,1,2,3,4,5,6,7,8,9,0,1
%N A055087 Integers 0..n then 0..n then 0..n+1 then 0..n+1 etc.
%C A055087 Second column in the monotonic justified array of all positive generalized Fibonacci sequences (A160271). see also A199474. - _Casey Mongoven_, Nov 06 2011
%C A055087 Can also be seen as an irregular triangle with duplicated rows of A002262. - _Reinhard Zumkeller_, Jul 14 2015
%H A055087 Reinhard Zumkeller, <a href="/A055087/b055087.txt">Rows n = 0..120 of triangle, flattened</a>
%H A055087 Michael Somos, <a href="/A073189/a073189.txt">Sequences used for indexing triangular or square arrays</a>
%e A055087 0; 0; 0,1; 0,1; 0,1,2; 0,1,2; 0,1,2,3; 0,1,2,3; ...
%t A055087 With[{nn=10},Flatten[Table[{Range[0,n],Range[0,n]},{n,0,nn}]]] (* _Harvey P. Dale_, May 30 2015 *)
%o A055087 (PARI) {a(n) = (1 + 4*n - sqr( floor( sqrt( 1 + 4*n)))) \ 4}
%o A055087 (Haskell)
%o A055087 import Data.List (transpose)
%o A055087 a055087 n k = a055087_tabf !! n !! k
%o A055087 a055087_row n = a055087_tabf !! n
%o A055087 a055087_tabf = concat $ transpose [a002262_tabl, a002262_tabl]
%o A055087 a055087_list = concat a055087_tabf
%o A055087 -- _Reinhard Zumkeller_, Jul 14 2015
%Y A055087 Cf. A002262.
%K A055087 nonn,easy,tabf
%O A055087 0,9
%A A055087 _Michael Somos_, Jun 13 2000