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.

A290884 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 real part of the n-th term of S.

Table of values

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

List of values

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