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.

A175479 a(1)=1. For n >= 1, if a(n) = 0, then append to the sequence the digits of binary n+1 (most significant digits first and least significant digits last). If a(n) = 1, then append to the sequence the digits of binary n+1 in reverse order (least significant digits first and most significant digits last).

Table of values

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

List of values

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