|
%I #5 Mar 30 2012 18:57:43
%S 1,2,2,3,3,3,3,4,5,4,5,5,5,5,5,6,7,5,7,5,6,7,7,7,7,7,7,7,8,8,8,8,8,8,
%T 8,8,8,9,10,9,9,9,9,10,8,10,11,10,10,9,10,11,9,10,10,11,11,12,10,12,
%U 10,12,10,11,11,11,12,12,12,13,12,12,13,12,11,12,12,11,14,12,14
%N Triangular array: g(n,k)=number of fractional parts (i*r) in interval [(k-1)/n, k/n], for 1<=i<=n^2, 1<=k<=n, r=3-e.
%C See A194285.
%e First eight rows:
%e 1
%e 2..2
%e 3..3..3
%e 3..4..5..4
%e 5..5..5..5..5
%e 6..7..5..7..5..6
%e 7..7..7..7..7..7..7
%e 8..8..8..8..8..8..8..8
%t r = 3-E;
%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, n^2}]
%t TableForm[Table[g[n, k], {n, 1, 14}, {k, 1, n}]]
%t Flatten[%] (* A194343 *)
%Y Cf. A194343.
%K nonn,tabl
%O 1,2
%A _Clark Kimberling_, Aug 22 2011
|
