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.

A290885 Let S be the sequence generated by these rules: 0 is in S, and if z is in S, then z * (1+i) and (z-1) * (1+i) + 1 are in S (where i denotes the imaginary unit), and duplicates are deleted as they occur; a(n) = the imaginary part of the n-th term of S.

Table of values

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

List of values

[0, -1, -1, -2, 0, -1, -1, -2, 2, 1, 1, 0, 2, 1, 1, 0, 4, 3, 3, 2, 4, 3, 3, 2, 6, 5, 5, 4, 6, 5, 5, 4, 4, 3, 3, 2, 4, 3, 3, 2, 6, 5, 5, 4, 6, 5, 5, 4, 8, 7, 7, 6, 8, 7, 7, 6, 10, 9, 9, 8, 10, 9, 9, 8, 0, -1, -1, -2, 0, -1, -1, -2, 2, 1, 1, 0, 2, 1, 1, 0, 4, 3]