A194328 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=2-sqrt(2).
2, 2, 2, 2, 3, 3, 4, 4, 4, 4, 6, 6, 7, 7, 6, 10, 11, 10, 11, 11, 11, 18, 18, 18, 18, 19, 18, 19, 32, 32, 32, 31, 33, 31, 33, 32, 57, 57, 56, 57, 57, 57, 58, 56, 57, 101, 103, 102, 103, 101, 104, 102, 103, 102, 103, 185, 188, 186, 186, 185, 187, 187, 186, 187, 184
Offset: 1
Examples
First eight rows: 2 2...2 2...3...3 4...4...4...4 6...6...7...7...6 10..11..10..11..11..11 18..18..18..18..19..18..19 32..32..32..31..33..31..33..32
Crossrefs
Cf. A194285.
Programs
-
Mathematica
r = 2-Sqrt[2]; 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, 2^n}] TableForm[Table[g[n, k], {n, 1, 14}, {k, 1, n}]] Flatten[%] (* A194328 *)
Comments