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.

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

Table of values

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

List of values

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

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

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