login
A194309
Triangular array: g(n,k)=number of fractional parts (i*e) in interval [(k-1)/n, k/n], for 1<=i<=n, 1<=k<=n.
2
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 0, 1, 1, 1, 1, 1, 1, 2, 1, 0, 1, 2, 0, 1, 2, 1, 0, 2, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 1, 0, 2, 0, 2, 2, 0, 2, 0, 1, 0, 2, 0, 2, 1, 1, 1, 1, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 0
OFFSET
1,13
COMMENTS
See A194285.
EXAMPLE
1
1..1
1..1..1
1..1..1..1
1..0..2..1..1
1..1..1..1..1..1
1..1..1..1..1..1..1
1..1..1..1..1..2..1..0
MATHEMATICA
r = E;
f[n_, k_, i_] := If[(k - 1)/n <= FractionalPart[i*r] < k/n, 1, 0]
g[n_, k_] := Sum[f[n, k, i], {i, 1, n}]
TableForm[Table[g[n, k], {n, 1, 14}, {k, 1, n}]]
Flatten[%] (* A194309 *)
CROSSREFS
Cf. A194285.
Sequence in context: A284562 A349542 A087102 * A369936 A374326 A318829
KEYWORD
nonn,tabl
AUTHOR
Clark Kimberling, Aug 21 2011
STATUS
approved