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!)
 A194302 Triangular array:  g(n,k)=number of fractional parts (i*sqrt(5)) in interval [(k-1)/n, k/n], for 1<=i<=2n, 1<=k<=n. 2

%I

%S 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,3,2,2,2,2,2,3,1,3,1,2,2,2,2,2,2,2,

%T 2,2,2,2,3,2,2,2,2,2,1,2,2,2,2,3,2,1,3,2,1,2,2,3,2,1,3,1,3,1,2,2,2,1,

%U 4,1,2,3,1,3,2,2,1,2,2,2,2,3,1,2,2,2,2,2,2,2,2,2,2,2,2,1,3,3,1

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

%C See A194285.

%e First eight rows:

%e 2

%e 2..2

%e 2..2..2

%e 2..2..2..2

%e 2..2..2..2..2

%e 1..2..3..2..2..2

%e 2..2..3..1..3..1..2

%e 2..2..2..2..2..2..2..2

%t r = Sqrt[5];

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

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

%t Flatten[%] (* A194302 *)

%Y Cf. A194285.

%K nonn,tabl

%O 1,1

%A _Clark Kimberling_, Aug 21 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 2 06:13 EDT 2021. Contains 346409 sequences. (Running on oeis4.)