cp's OEIS Frontend

A194290 Triangular array: g(n,k)=number of fractional parts (i*sqrt(3)) in interval [(k-1)/n, k/n], for 1<=i<=2n, 1<=k<=n.

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