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.

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

Table of values

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

List of values

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

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

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