|
%I #5 Mar 30 2012 18:57:43
%S 2,2,2,2,3,3,4,4,4,4,6,6,7,7,6,10,11,10,11,11,11,18,18,18,18,19,18,19,
%T 32,32,32,31,33,31,33,32,57,57,56,57,57,57,58,56,57,101,103,102,103,
%U 101,104,102,103,102,103,185,188,186,186,185,187,187,186,187,184
%N Triangular array: g(n,k)=number of fractional parts (i*r) in interval [(k-1)/n, k/n], for 1<=i<=2^n, 1<=k<=n, r=2-sqrt(2).
%C See A194285.
%e First eight rows:
%e 2
%e 2...2
%e 2...3...3
%e 4...4...4...4
%e 6...6...7...7...6
%e 10..11..10..11..11..11
%e 18..18..18..18..19..18..19
%e 32..32..32..31..33..31..33..32
%t r = 2-Sqrt[2];
%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[%] (* A194328 *)
%Y Cf. A194285.
%K nonn,tabl
%O 1,1
%A _Clark Kimberling_, Aug 22 2011
|
