login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A194288 Triangular array:  g(n,k)=number of fractional parts (i*sqrt(2)) in interval [(k-1)/n, k/n], for 1<=i<=2^n, 1<=k<=n. 2
2, 2, 2, 3, 3, 2, 4, 4, 4, 4, 6, 7, 7, 6, 6, 11, 11, 11, 10, 11, 10, 19, 18, 19, 18, 18, 18, 18, 32, 33, 31, 33, 31, 32, 32, 32, 57, 56, 58, 57, 57, 57, 56, 57, 57, 103, 102, 103, 102, 104, 101, 103, 102, 103, 101, 187, 184, 187, 186, 187, 187, 185, 186, 186, 188 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

See A194285.

LINKS

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

EXAMPLE

First eight rows:

2

2...2

3...3...2

4...4...4...4

6...7...7...6...6

11..11..11..10..11..10

19..18..19..18..18..18..18

32..33..31..33..31..32..32..32

MATHEMATICA

r = 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[%]    (* A194288 *)

CROSSREFS

Cf. A194285.

Sequence in context: A116505 A110534 A194340 * A194332 A322062 A071451

Adjacent sequences:  A194285 A194286 A194287 * A194289 A194290 A194291

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 December 11 07:47 EST 2019. Contains 329914 sequences. (Running on oeis4.)