A326936 - cp's OEIS frontend

A326936 Consider an empty list L, and for k = 1, 2, ...: if L contains a pair of consecutive terms summing to k, then let (u, v) be the first such pair: replace the two terms u and v in L with a single term k and set a(u) = -k and a(v) = +k, otherwise append k to L.

n	a(n)
1	-3
2	3
3	-7
4	7
5	-11
6	11
7	-18
8	-17
9	17
10	-22
11	18
12	22
13	-27
14	27
15	-31
16	31
17	35
18	-35
19	-39
20	39
21	-44
22	-49
23	44
24	68
25	-51
26	51
27	49
28	-57
29	57
30	-62
31	-70
32	62
33	-67
34	67
35	-84
36	-73
37	73
38	-78
39	70
40	78
41	-83
42	83
43	-88
44	-68
45	88
46	-93
47	93
48	-98
49	84
50	98
51	-108
52	-105
53	105
54	-109
55	109
56	-114
57	108

[-3, 3, -7, 7, -11, 11, -18, -17, 17, -22, 18, 22, -27, 27, -31, 31, 35, -35, -39, 39, -44, -49, 44, 68, -51, 51, 49, -57, 57, -62, -70, 62, -67, 67, -84, -73, 73, -78, 70, 78, -83, 83, -88, -68, 88, -93, 93, -98, 84, 98, -108, -105, 105, -109, 109, -114, 108]

cp's OEIS Frontend

A326936 Consider an empty list L, and for k = 1, 2, ...: if L contains a pair of consecutive terms summing to k, then let (u, v) be the first such pair: replace the two terms u and v in L with a single term k and set a(u) = -k and a(v) = +k, otherwise append k to L.

Table of values

List of values