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.

A135133 a(n) = floor(S2(n)/3) mod 2, where S2(n) denotes the binary weight of n.

Table of values

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

List of values

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