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 A194333 #6 Mar 30 2012 18:57:43
%S A194333 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,2,1,1,1,1,1,1,1,1,1,1,
%T A194333 1,1,1,1,1,2,1,0,2,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,1,0,1,1,1,1,1,1,
%U A194333 1,1,1,1,1,1,1,2,1,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,2,0,2,1,1,1,1
%N A194333 Triangular array: g(n,k)=number of fractional parts (i*r) in interval [(k-1)/n, k/n], for 1<=i<=n, 1<=k<=n, r=2-tau, where tau=(1+sqrt(5))/2, the golden ratio.
%C A194333 See A194285.
%e A194333 First eleven rows:
%e A194333 1
%e A194333 1..1
%e A194333 1..1..1
%e A194333 1..1..1..1
%e A194333 1..1..1..1..1
%e A194333 1..1..1..1..1..1
%e A194333 0..1..2..1..1..1..1
%e A194333 1..1..1..1..1..1..1..1
%e A194333 1..1..1..2..1..0..2..0..1
%e A194333 1..1..1..1..1..1..1..1..1..1
%e A194333 1..1..1..1..2..1..0..1..1..1..1
%t A194333 r = 2-GolenRatio;
%t A194333 f[n_, k_, i_] := If[(k - 1)/n <= FractionalPart[i*r] < k/n, 1, 0]
%t A194333 g[n_, k_] := Sum[f[n, k, i], {i, 1, n}]
%t A194333 TableForm[Table[g[n, k], {n, 1, 14}, {k, 1, n}]]
%t A194333 Flatten[%] (* A194333 *)
%Y A194333 Cf. A194333.
%K A194333 nonn,tabl
%O A194333 1,24
%A A194333 _Clark Kimberling_, Aug 22 2011