|
%I #8 Apr 10 2021 08:04:37
%S 2,3,1,3,2,3,3,5,4,4,5,7,8,4,8,10,9,10,12,12,11,19,18,18,18,18,18,19,
%T 31,31,32,32,32,32,32,34,53,58,55,61,55,57,53,60,60,99,100,100,108,
%U 100,100,108,100,100,109,180,182,180,200,182,180,182,200,180,182
%N Triangular array: g(n,k) = number of fractional parts (i*Pi) in interval [(k-1)/n, k/n], for 1 <= i <= 2^n, 1 <= k <= n.
%C See A194285.
%e First six rows:
%e 2;
%e 3, 1;
%e 3, 2, 3;
%e 3, 5, 4, 4;
%e 5, 7, 8, 4, 8;
%e 10, 9, 10, 12, 12, 11;
%t r = Pi;
%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[%] (* A194308 *)
%Y Cf. A194285.
%K nonn,tabl
%O 1,1
%A _Clark Kimberling_, Aug 21 2011
|
