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