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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A194290 Triangular array:  g(n,k)=number of fractional parts (i*sqrt(3)) in interval [(k-1)/n, k/n], for 1<=i<=2n, 1<=k<=n. 2
2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 1, 2, 2, 1, 2, 2, 3, 2, 2, 1, 3, 2, 1, 3, 2, 2, 2, 2, 1, 3, 1, 2, 2, 2, 2, 3, 1, 3, 1, 3, 2, 1, 3, 2, 1, 3, 2, 2, 2, 1, 2, 3, 1, 2, 2, 2, 3, 2, 1, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 3, 2 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

See A194285.

LINKS

Table of n, a(n) for n=1..99.

EXAMPLE

First eight rows:

2

2..2

1..3..2

2..2..2..2

2..2..2..2..2

2..2..2..2..2..2

2..2..2..2..2..3..1

2..2..1..2..2..3..2..2

MATHEMATICA

r = Sqrt[3];

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

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

Flatten[%]    (* A194290 *)

CROSSREFS

Cf. A194290.

Sequence in context: A133138 A194326 A295277 * A329028 A257079 A260372

Adjacent sequences:  A194287 A194288 A194289 * A194291 A194292 A194293

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling, Aug 21 2011

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 1 14:39 EDT 2020. Contains 333163 sequences. (Running on oeis4.)