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.

A322575 z(1) = 0, and for any n > 0, z(4*n-2) = z(n) + k(n), z(4*n-1) = z(n) + i*k(n), z(4*n) = z(n) - k(n) and z(4*n+1) = z(n) - i*k(n) where k(n) is the least positive integer not leading to a duplicate term in sequence z (and i denotes the imaginary unit); a(n) is the imaginary part of z(n).

Table of values

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

List of values

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