%I #5 Mar 30 2012 18:57:42
%S 2,2,2,2,3,3,2,6,3,5,6,6,7,7,6,11,10,11,11,11,10,19,18,18,18,18,19,18,
%T 31,32,32,33,31,32,32,33,56,57,58,55,57,58,56,58,57,102,102,101,104,
%U 103,102,103,102,103,102,185,186,185,186,186,186,187,186,187,187
%N Triangular array: g(n,k)=number of fractional parts (i*sqrt(8)) in interval [(k-1)/n, k/n], for 1<=i<=2^n, 1<=k<=n.
%C See A194285.
%e First eight rows:
%e 2
%e 2...2
%e 2...3...3
%e 2...6...3...5
%e 6...6...7...7...6
%e 11..10..11..11..11..10
%e 19..18..18..18..18..19..18
%e 31..32..32..33..31..32..32..33
%t r = Sqrt[8];
%t f[n_, k_, i_] := If[(k - 1)/n <= FractionalPart[i*r] < k/n, 1, 0]
%t g[n_, k_] := Sum[f[n, k, i], {i, 1, 2^n}]
%t TableForm[Table[g[n, k], {n, 1, 14}, {k, 1, n}]]
%t Flatten[%] (* A194320 *)
%Y Cf. A194285.
%K nonn,tabl
%O 1,1
%A _Clark Kimberling_, Aug 22 2011