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.

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

Table of values

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

List of values

[1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 0, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 3, 1, 3, 0, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0, 2, 4, 1, 3, 1, 2, 0, 1, 3, 1, 2, 0, 2, 3, 1, 3, 0]