cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A194344 #5 Mar 30 2012 18:57:43
%S A194344 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 A194344 32,32,33,32,32,31,32,32,56,56,59,56,57,57,56,58,57,102,102,103,102,
%U A194344 102,103,103,101,102,104,185,187,186,186,187,185,187,186,186,186
%N 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.
%C A194344 See A194285.
%e A194344 First eight rows:
%e A194344 2
%e A194344 2...2
%e A194344 3...2...3
%e A194344 3...4...5...4
%e A194344 7...6...6...7...6
%e A194344 10..11..11..11..11..10
%e A194344 19..19..18..18..18..18..18
%e A194344 32..32..33..32..32..31..32..32
%t A194344 r = 3-E;
%t A194344 f[n_, k_, i_] := If[(k - 1)/n <= FractionalPart[i*r] < k/n, 1, 0]
%t A194344 g[n_, k_] := Sum[f[n, k, i], {i, 1, 2^n}]
%t A194344 TableForm[Table[g[n, k], {n, 1, 14}, {k, 1, n}]]
%t A194344 Flatten[%]    (* A194344 *)
%Y A194344 Cf. A194285.
%K A194344 nonn,tabl
%O A194344 1,1
%A A194344 _Clark Kimberling_, Aug 22 2011