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.

A194286 Triangular array: g(n,k)=number of fractional parts (i*sqrt(2)) in interval [(k-1)/n, k/n], for 1<=i<=2n, 1<=k<=n.

This page as a plain text file.
%I A194286 #5 Mar 30 2012 18:57:42
%S A194286 2,2,2,2,3,1,2,3,1,2,2,2,2,2,2,2,2,2,2,2,2,2,1,3,2,1,3,2,1,3,1,3,1,3,
%T A194286 2,2,2,2,2,2,2,3,1,2,2,2,1,3,2,3,1,2,2,3,1,2,2,2,2,2,2,2,2,2,3,1,2,2,
%U A194286 2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,3,2,1,2,2,3,2,2,2,2,2,2,2,2,2,2
%N A194286 Triangular array:  g(n,k)=number of fractional parts (i*sqrt(2)) in interval [(k-1)/n, k/n], for 1<=i<=2n, 1<=k<=n.
%C A194286 See A194285.
%e A194286 First eight rows:
%e A194286 2
%e A194286 2..2
%e A194286 2..3..1
%e A194286 2..3..1..2
%e A194286 2..2..2..2..2
%e A194286 2..2..2..2..2..2
%e A194286 2..1..3..2..1..3..2
%e A194286 1..3..1..3..1..3..2..2
%t A194286 r = Sqrt[2];
%t A194286 f[n_, k_, i_] := If[(k - 1)/n <= FractionalPart[i*r] < k/n, 1, 0]
%t A194286 g[n_, k_] := Sum[f[n, k, i], {i, 1, 2 n}]
%t A194286 TableForm[Table[g[n, k], {n, 1, 14}, {k, 1, n}]]
%t A194286 Flatten[%]    (* A194286 *)
%Y A194286 Cf. A194285.
%K A194286 nonn,tabl
%O A194286 1,1
%A A194286 _Clark Kimberling_, Aug 21 2011