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.

A175480 a(1)=1. For n >= 1, if a(n) = 1, then append to the sequence the digits of binary n+1 (most significant digits first and least significant digits last). If a(n) = 0, 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 1
3 0
4 1
5 1
6 0
7 0
8 1
9 1
10 0
11 1
12 1
13 1
14 0
15 1
16 1
17 1
18 0
19 0
20 0
21 1
22 1
23 0
24 0
25 1
26 1
27 0
28 1
29 0
30 1
31 1
32 0
33 1
34 1
35 1
36 0
37 0
38 1
39 1
40 0
41 1
42 1
43 1
44 1
45 0
46 1
47 1
48 1
49 1
50 1
51 0
52 0
53 0
54 0
55 1
56 0
57 0
58 0
59 1
60 1
61 0
62 0
63 1
64 0
65 1
66 1
67 0
68 0
69 1
70 0
71 0
72 1
73 0
74 1
75 1
76 0
77 1
78 0
79 1
80 1
81 0
82 1
83 1
84 0

List of values

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