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.

A317050 a(0) = 0 and for any n >= 0, a(n+1) is obtained by changing the rightmost possible digit in the negabinary representation of a(n) so as to get a value not yet in the sequence.

Table of values

n a(n)
0 0
1 1
2 -1
3 -2
4 2
5 3
6 5
7 4
8 -4
9 -3
10 -5
11 -6
12 -10
13 -9
14 -7
15 -8
16 8
17 9
18 7
19 6
20 10
21 11
22 13
23 12
24 20
25 21
26 19
27 18
28 14
29 15
30 17
31 16
32 -16
33 -15
34 -17
35 -18
36 -14
37 -13
38 -11
39 -12
40 -20
41 -19
42 -21
43 -22
44 -26
45 -25
46 -23
47 -24
48 -40
49 -39
50 -41
51 -42
52 -38
53 -37
54 -35
55 -36
56 -28
57 -27
58 -29
59 -30

List of values

[0, 1, -1, -2, 2, 3, 5, 4, -4, -3, -5, -6, -10, -9, -7, -8, 8, 9, 7, 6, 10, 11, 13, 12, 20, 21, 19, 18, 14, 15, 17, 16, -16, -15, -17, -18, -14, -13, -11, -12, -20, -19, -21, -22, -26, -25, -23, -24, -40, -39, -41, -42, -38, -37, -35, -36, -28, -27, -29, -30]