A365968 - cp's OEIS frontend

A365968 Irregular triangle read by rows: T(n,k) (0 <= n, 0 <= k < 2^n). An infinite binary tree with root node 0 in row n = 0. Each node then has left child (2j) - k - 1 and right child (2j) - k + 1, where j and k are the values of the parent and grandparent nodes respectively.

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

[0, -1, 1, -3, -1, 1, 3, -6, -4, -2, 0, 0, 2, 4, 6, -10, -8, -6, -4, -4, -2, 0, 2, -2, 0, 2, 4, 4, 6, 8, 10, -15, -13, -11, -9, -9, -7, -5, -3, -7, -5, -3, -1, -1, 1, 3, 5, -5, -3, -1, 1, 1, 3, 5, 7, 3, 5, 7, 9, 9, 11, 13, 15, -21, -19, -17, -15, -15, -13, -11, -9]

cp's OEIS Frontend

A365968 Irregular triangle read by rows: T(n,k) (0 <= n, 0 <= k < 2^n). An infinite binary tree with root node 0 in row n = 0. Each node then has left child (2j) - k - 1 and right child (2j) - k + 1, where j and k are the values of the parent and grandparent nodes respectively.

Table of values

List of values

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

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

cp's OEIS Frontend

A365968 Irregular triangle read by rows: T(n,k) (0 <= n, 0 <= k < 2^n). An infinite binary tree with root node 0 in row n = 0. Each node then has left child (2*j) - k - 1 and right child (2*j) - k + 1, where j and k are the values of the parent and grandparent nodes respectively.

Table of values

List of values

A365968 Irregular triangle read by rows: T(n,k) (0 <= n, 0 <= k < 2^n). An infinite binary tree with root node 0 in row n = 0. Each node then has left child (2j) - k - 1 and right child (2j) - k + 1, where j and k are the values of the parent and grandparent nodes respectively.

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