A346083 - cp's OEIS frontend

A346083 Triangle, read by rows, defined by recurrence: T(n,k) = T(n-1,k-1) + (-1)^k * (2 * k + 1) * T(n-1,k) for 0 < k < n with initial values T(n,0) = T(n,n) = 1 for n >= 0 and T(i,j) = 0 if j < 0 or j > i.

n	a(n)
0	1
1	1
2	1
3	1
4	-2
5	1
6	1
7	7
8	3
9	1
10	1
11	-20
12	22
13	-4
14	1
15	1
16	61
17	90
18	50
19	5
20	1
21	1
22	-182
23	511
24	-260
25	95
26	-6
27	1
28	1
29	547
30	2373
31	2331
32	595
33	161
34	7
35	1
36	1
37	-1640
38	12412
39	-13944
40	7686
41	-1176
42	252
43	-8
44	1
45	1
46	4921
47	60420
48	110020
49	55230
50	20622
51	2100
52	372
53	9
54	1
55	1
56	-14762
57	307021
58	-709720
59	607090
60	-171612
61	47922
62	-3480
63	525
64	-10
65	1

[1, 1, 1, 1, -2, 1, 1, 7, 3, 1, 1, -20, 22, -4, 1, 1, 61, 90, 50, 5, 1, 1, -182, 511, -260, 95, -6, 1, 1, 547, 2373, 2331, 595, 161, 7, 1, 1, -1640, 12412, -13944, 7686, -1176, 252, -8, 1, 1, 4921, 60420, 110020, 55230, 20622, 2100, 372, 9, 1, 1, -14762, 307021, -709720, 607090, -171612, 47922, -3480, 525, -10, 1]

cp's OEIS Frontend

A346083 Triangle, read by rows, defined by recurrence: T(n,k) = T(n-1,k-1) + (-1)^k * (2 * k + 1) * T(n-1,k) for 0 < k < n with initial values T(n,0) = T(n,n) = 1 for n >= 0 and T(i,j) = 0 if j < 0 or j > i.

Table of values

List of values