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.

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

Table of values

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

List of values

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