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