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