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.

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

Table of values

n a(n)
1 1
2 2
3 0
4 2
5 1
6 0
7 1
8 2
9 1
10 0
11 1
12 1
13 2
14 1
15 0
16 1
17 1
18 1
19 1
20 1
21 1
22 1
23 1
24 1
25 1
26 1
27 1
28 1
29 0
30 2
31 1
32 1
33 1
34 1
35 1
36 1
37 0
38 2
39 2
40 1
41 0
42 1
43 1
44 1
45 1
46 0
47 2
48 2
49 0
50 2
51 1
52 0
53 1
54 1
55 1
56 0
57 2
58 0
59 2
60 2
61 0
62 2
63 1
64 0
65 1
66 1
67 0
68 2
69 0
70 2
71 1
72 1
73 2
74 0
75 2
76 0
77 1
78 1
79 0
80 2
81 0
82 2
83 0
84 2
85 0
86 2
87 0
88 2
89 1
90 1
91 1
92 0
93 2
94 0
95 2
96 0
97 2
98 0
99 2

List of values

[1, 2, 0, 2, 1, 0, 1, 2, 1, 0, 1, 1, 2, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 2, 1, 1, 1, 1, 1, 1, 0, 2, 2, 1, 0, 1, 1, 1, 1, 0, 2, 2, 0, 2, 1, 0, 1, 1, 1, 0, 2, 0, 2, 2, 0, 2, 1, 0, 1, 1, 0, 2, 0, 2, 1, 1, 2, 0, 2, 0, 1, 1, 0, 2, 0, 2, 0, 2, 0, 2, 0, 2, 1, 1, 1, 0, 2, 0, 2, 0, 2, 0, 2]