A326281 - cp's OEIS frontend

A326281 Let f(n) be a sequence of distinct Gaussian integers such that f(1) = 0 and for any n > 1, f(n) = f(floor(n/2)) + k(n)g((1+i)^(A000120(n)-1) (1-i)^A023416(n)) where k(n) > 0 is as small as possible and g(z) = z/gcd(Re(z), Im(z)); a(n) is the imaginary part of f(n).

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

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

cp's OEIS Frontend

A326281 Let f(n) be a sequence of distinct Gaussian integers such that f(1) = 0 and for any n > 1, f(n) = f(floor(n/2)) + k(n)g((1+i)^(A000120(n)-1) (1-i)^A023416(n)) where k(n) > 0 is as small as possible and g(z) = z/gcd(Re(z), Im(z)); a(n) is the imaginary part of f(n).

Table of values

List of values

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

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

cp's OEIS Frontend

A326281 Let f(n) be a sequence of distinct Gaussian integers such that f(1) = 0 and for any n > 1, f(n) = f(floor(n/2)) + k(n)*g((1+i)^(A000120(n)-1) * (1-i)^A023416(n)) where k(n) > 0 is as small as possible and g(z) = z/gcd(Re(z), Im(z)); a(n) is the imaginary part of f(n).

Table of values

List of values

A326281 Let f(n) be a sequence of distinct Gaussian integers such that f(1) = 0 and for any n > 1, f(n) = f(floor(n/2)) + k(n)g((1+i)^(A000120(n)-1) (1-i)^A023416(n)) where k(n) > 0 is as small as possible and g(z) = z/gcd(Re(z), Im(z)); a(n) is the imaginary part of f(n).

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