A361189 - cp's OEIS frontend

A361189 Infinite sequence of nonzero integers build the greedy way such that the sums Sum_{i = k2^e..(k+1)2^e} a(i) with k, e >= 0 are all distinct; each term is minimal in absolute value and in case of a tie, preference is given to the positive value.

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

[1, 2, -1, -4, -3, -6, 4, -11, 5, 6, 7, 8, -8, -12, 9, 21, -10, -13, 12, 25, 13, 16, -14, 31, -15, -17, 19, 33, -19, -21, 22, 41, -22, -24, 24, 49, -25, -26, -27, -28, 28, 34, -29, 61, -30, -31, -33, -34, 35, 39, -35, 75, -36, -37, 38, 77, -38, -39, -41, -42]

cp's OEIS Frontend

A361189 Infinite sequence of nonzero integers build the greedy way such that the sums Sum_{i = k2^e..(k+1)2^e} a(i) with k, e >= 0 are all distinct; each term is minimal in absolute value and in case of a tie, preference is given to the positive value.

Table of values

List of values

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

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

cp's OEIS Frontend

A361189 Infinite sequence of nonzero integers build the greedy way such that the sums Sum_{i = k*2^e..(k+1)*2^e} a(i) with k, e >= 0 are all distinct; each term is minimal in absolute value and in case of a tie, preference is given to the positive value.

Table of values

List of values

A361189 Infinite sequence of nonzero integers build the greedy way such that the sums Sum_{i = k2^e..(k+1)2^e} a(i) with k, e >= 0 are all distinct; each term is minimal in absolute value and in case of a tie, preference is given to the positive value.

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