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.

A190436 a(n) = [(b*n+c)*r] - b*[n*r] - [c*r], where (r,b,c)=(golden ratio,3,2) and []=floor.

Table of values

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

List of values

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