login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A194308 Triangular array: g(n,k) = number of fractional parts (i*Pi) in interval [(k-1)/n, k/n], for 1 <= i <= 2^n, 1 <= k <= n. 2
2, 3, 1, 3, 2, 3, 3, 5, 4, 4, 5, 7, 8, 4, 8, 10, 9, 10, 12, 12, 11, 19, 18, 18, 18, 18, 18, 19, 31, 31, 32, 32, 32, 32, 32, 34, 53, 58, 55, 61, 55, 57, 53, 60, 60, 99, 100, 100, 108, 100, 100, 108, 100, 100, 109, 180, 182, 180, 200, 182, 180, 182, 200, 180, 182 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
See A194285.
LINKS
EXAMPLE
First six rows:
2;
3, 1;
3, 2, 3;
3, 5, 4, 4;
5, 7, 8, 4, 8;
10, 9, 10, 12, 12, 11;
MATHEMATICA
r = Pi;
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[%] (* A194308 *)
CROSSREFS
Cf. A194285.
Sequence in context: A099054 A071282 A107796 * A257070 A289171 A231633
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)