The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A194341 Triangular array:  g(n,k)=number of fractional parts (i*r) in interval [(k-1)/n, k/n], for 1<=i<=n, 1<=k<=n, r=3-e. 2
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 1, 1, 0, 1, 2, 1, 1, 1, 1, 1, 1, 0, 1, 2, 0, 1, 2, 1, 0, 2, 1, 0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2, 0, 2, 2, 0, 2, 0, 1, 1, 1, 1, 0, 2, 0, 2, 1, 1, 1, 1, 2, 0, 2, 0, 1, 0, 2, 0, 2, 0, 2, 0, 2, 0 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,13 COMMENTS See A194285. LINKS EXAMPLE First ten rows: 1 1..1 1..1..1 1..1..1..1 1..1..2..0..1 1..1..1..1..1..1 1..1..1..1..1..1..1 0..1..2..1..1..1..1..1 0..1..2..0..1..2..1..0..2..1 MATHEMATICA r = 3-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[%]    (* A194341 *) CROSSREFS Cf. A193285. Sequence in context: A265196 A171157 A194301 * A171905 A327406 A336865 Adjacent sequences:  A194338 A194339 A194340 * A194342 A194343 A194344 KEYWORD nonn,tabl AUTHOR Clark Kimberling, Aug 22 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 5 03:03 EST 2021. Contains 349530 sequences. (Running on oeis4.)