A361234 - cp's OEIS frontend

A361234 Infinite sequence of nonzero integers build the greedy way such that the products Product_{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	3
4	-3
5	4
6	-4
7	5
8	-5
9	6
10	-6
11	7
12	-7
13	8
14	-8
15	9
16	10
17	-10
18	11
19	-11
20	12
21	-12
22	13
23	-13
24	14
25	-14
26	15
27	-15
28	16
29	17
30	-17
31	-18
32	19
33	-19
34	20
35	-20
36	21
37	-21
38	22
39	-22
40	23
41	-23
42	24
43	-24
44	25
45	26
46	-26
47	27
48	-27
49	28
50	-28
51	29
52	-29
53	30
54	-30
55	31
56	-31
57	32
58	-32
59	33
60	-33
61	34

[-1, 2, 3, -3, 4, -4, 5, -5, 6, -6, 7, -7, 8, -8, 9, 10, -10, 11, -11, 12, -12, 13, -13, 14, -14, 15, -15, 16, 17, -17, -18, 19, -19, 20, -20, 21, -21, 22, -22, 23, -23, 24, -24, 25, 26, -26, 27, -27, 28, -28, 29, -29, 30, -30, 31, -31, 32, -32, 33, -33, 34]

cp's OEIS Frontend

A361234 Infinite sequence of nonzero integers build the greedy way such that the products Product_{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	3
4	-3
5	4
6	-4
7	5
8	-5
9	6
10	-6
11	7
12	-7
13	8
14	-8
15	9
16	10
17	-10
18	11
19	-11
20	12
21	-12
22	13
23	-13
24	14
25	-14
26	15
27	-15
28	16
29	17
30	-17
31	-18
32	19
33	-19
34	20
35	-20
36	21
37	-21
38	22
39	-22
40	23
41	-23
42	24
43	-24
44	25
45	26
46	-26
47	27
48	-27
49	28
50	-28
51	29
52	-29
53	30
54	-30
55	31
56	-31
57	32
58	-32
59	33
60	-33
61	34

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

cp's OEIS Frontend

A361234 Infinite sequence of nonzero integers build the greedy way such that the products Product_{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

A361234 Infinite sequence of nonzero integers build the greedy way such that the products Product_{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	3
4	-3
5	4
6	-4
7	5
8	-5
9	6
10	-6
11	7
12	-7
13	8
14	-8
15	9
16	10
17	-10
18	11
19	-11
20	12
21	-12
22	13
23	-13
24	14
25	-14
26	15
27	-15
28	16
29	17
30	-17
31	-18
32	19
33	-19
34	20
35	-20
36	21
37	-21
38	22
39	-22
40	23
41	-23
42	24
43	-24
44	25
45	26
46	-26
47	27
48	-27
49	28
50	-28
51	29
52	-29
53	30
54	-30
55	31
56	-31
57	32
58	-32
59	33
60	-33
61	34