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.

A290536 Let S be the sequence generated by these rules: 0 is in S, and if z is in S, then z + 1 and z * (1+i) 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 1
3 2
4 1
5 3
6 2
7 2
8 0
9 4
10 3
11 3
12 0
13 3
14 1
15 1
16 -2
17 5
18 4
19 4
20 0
21 4
22 1
23 1
24 -4
25 4
26 2
27 2
28 -2
29 -1
30 -1
31 -4
32 6
33 5
34 5
35 0
36 5
37 1
38 1
39 -6
40 5
41 2
42 2
43 -4
44 -3
45 -3
46 -8
47 5
48 3
49 3
50 -2
51 -1
52 -1
53 -6
54 0
55 -4
56 -3
57 -3
58 -4
59 7
60 6
61 6
62 0
63 6
64 1
65 1
66 -8
67 6
68 2
69 2
70 -6
71 -5
72 -5
73 -12
74 6
75 3
76 3
77 -4
78 -3

List of values

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