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.

A173923 In the sequence of nonnegative integers substitute all n by 2^floor(n/8) occurrences of (n mod 2).

Table of values

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

List of values

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