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.

A330262 Start with an empty stack S; for n = 1, 2, 3, ..., interpret the binary representation of n from left to right as follows: in case of bit 1, push the number 1 on top of S, in case of bit 0, replace the two numbers on top of S, say u on top of v, with v-u; a(n) gives the number on top of S after processing n.

Table of values

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

List of values

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