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.

A190775 [(bn+c)r]-b[nr]-[cr], where (r,b,c)=(sqrt(1/2),3,2) and [ ]=floor.

Table of values

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

List of values

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