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.

A293208 Let b be the lexicographically earliest sequence of positive terms such that the function f defined by f(n) = Sum_{k=1..n} (i^k * b(k)) for any n >= 0 is injective (where i denotes the imaginary unit), and b(n) != b(n+1) and b() != b(n+2) for any n > 0; a(n) = real part of f(n).

Table of values

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

List of values

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