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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A194344 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=3-e. 2

%I

%S 2,2,2,3,2,3,3,4,5,4,7,6,6,7,6,10,11,11,11,11,10,19,19,18,18,18,18,18,

%T 32,32,33,32,32,31,32,32,56,56,59,56,57,57,56,58,57,102,102,103,102,

%U 102,103,103,101,102,104,185,187,186,186,187,185,187,186,186,186

%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=3-e.

%C See A194285.

%e First eight rows:

%e 2

%e 2...2

%e 3...2...3

%e 3...4...5...4

%e 7...6...6...7...6

%e 10..11..11..11..11..10

%e 19..19..18..18..18..18..18

%e 32..32..33..32..32..31..32..32

%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, 2^n}]

%t TableForm[Table[g[n, k], {n, 1, 14}, {k, 1, n}]]

%t Flatten[%] (* A194344 *)

%Y Cf. A194285.

%K nonn,tabl

%O 1,1

%A _Clark Kimberling_, Aug 22 2011

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 August 11 09:47 EDT 2020. Contains 336423 sequences. (Running on oeis4.)