A293209 - cp's OEIS frontend

A293209 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) = imaginary part of f(n).

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

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

cp's OEIS Frontend

A293209 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) = imaginary part of f(n).

Table of values

List of values

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

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

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