A361442 - cp's OEIS frontend

A361442 Infinite triangle T(n, k), n, k >= 0, read and filled by rows the greedy way with distinct integers such that for any n, k >= 0, T(n, k) + T(n+1, k) + T(n+1, k+1) = 0; each term is minimal in absolute value and in case of a tie, preference is given to the positive value.

n	a(n)
0	0
1	1
2	-1
3	2
4	-3
5	4
6	3
7	-5
8	8
9	-12
10	5
11	-8
12	13
13	-21
14	33
15	6
16	-11
17	19
18	-32
19	53
20	-86
21	-2
22	-4
23	15
24	-34
25	66
26	-119
27	205
28	9
29	-7
30	11
31	-26
32	60
33	-126
34	245
35	-450
36	10
37	-19
38	26
39	-37
40	63
41	-123
42	249
43	-494
44	944
45	7
46	-17
47	36
48	-62
49	99
50	-162
51	285
52	-534
53	1028
54	-1972

[0, 1, -1, 2, -3, 4, 3, -5, 8, -12, 5, -8, 13, -21, 33, 6, -11, 19, -32, 53, -86, -2, -4, 15, -34, 66, -119, 205, 9, -7, 11, -26, 60, -126, 245, -450, 10, -19, 26, -37, 63, -123, 249, -494, 944, 7, -17, 36, -62, 99, -162, 285, -534, 1028, -1972]

cp's OEIS Frontend

A361442 Infinite triangle T(n, k), n, k >= 0, read and filled by rows the greedy way with distinct integers such that for any n, k >= 0, T(n, k) + T(n+1, k) + T(n+1, k+1) = 0; 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