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.

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

Table of values

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

List of values

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

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.