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.

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

Table of values

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

List of values

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