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 A191361 #6 Mar 30 2012 18:57:32
%S A191361 0,1,-1,-2,2,-3,0,-4,-5,-1,-6,-7,3,-8,-2,-9,-10,1,-11,-3,-12,-13,-4,
%T A191361 -14,-15,0,-16,-5,-17,-18,-6,-19,-20,4,-21,-7,-22,-23,-1,-24,-8,-25,
%U A191361 -26,-9,-27,-28,2,-29,-10,-30,-31,-2,-32,-11,-33,-34,-12,-35,-36,-3
%N A191361 Number of the diagonal of the Wythoff difference array that contains n.
%C A191361 Every integer occurs in A191361 (infinitely many times).
%C A191361 Represent the array as {g(i,j): i>=1, j>=1}. Then for m>=0, (diagonal #m) is the sequence (g(i,i+m)), i>=1;
%C A191361 for m<0, (diagonal #m) is the sequence (g(i+m,i)), i>=1.
%e A191361 Diagonal #0 (the main diagonal) of A080164 is (1,7,26,...), so a(1)=0, a(7)=0, a(26)=0.
%t A191361 r = GoldenRatio; f[n_] := Fibonacci[n];
%t A191361 g[i_, j_] := f[2 j - 1]*Floor[i*r] + (i - 1) f[2 j - 2];
%t A191361 TableForm[Table[g[i, j], {i, 1, 10}, {j, 1, 5}]]
%t A191361 (* A080164, Wythoff difference array *)
%t A191361 a = Flatten[Table[If[g[i, j] == n, j - i, {}], {n, 60}, {i, 50}, {j, 50}]]
%t A191361 (* a=A191361 *)
%Y A191361 Cf. A080164, A114327, A191360, A191362.
%K A191361 sign
%O A191361 1,4
%A A191361 _Clark Kimberling_, May 31 2011