A255723 - cp's OEIS frontend

A255723 Another variant of Per Nørgård's "infinity sequence", cf. A004718: t(0) = 0; t(4n) = t(n); t(4n+1) = t(n) - 2; t(4n+2) = -t(n) - 1; t(4n+3) = t(n) + 2.

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

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

cp's OEIS Frontend

A255723 Another variant of Per Nørgård's "infinity sequence", cf. A004718: t(0) = 0; t(4n) = t(n); t(4n+1) = t(n) - 2; t(4n+2) = -t(n) - 1; t(4n+3) = t(n) + 2.

Table of values

List of values

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

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

cp's OEIS Frontend

A255723 Another variant of Per Nørgård's "infinity sequence", cf. A004718: t(0) = 0; t(4*n) = t(n); t(4*n+1) = t(n) - 2; t(4*n+2) = -t(n) - 1; t(4*n+3) = t(n) + 2.

Table of values

List of values

A255723 Another variant of Per Nørgård's "infinity sequence", cf. A004718: t(0) = 0; t(4n) = t(n); t(4n+1) = t(n) - 2; t(4n+2) = -t(n) - 1; t(4n+3) = t(n) + 2.

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