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.

A190483 a(n) = [(bn+c)r]-b[nr]-[cr], where (r,b,c)=(sqrt(2),2,1) and []=floor.

Table of values

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

List of values

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