A306547 - cp's OEIS frontend

A306547 Triangle read by rows, defined by Riordan's general Eulerian recursion: T(n, k) = (k+3)T(n-1, k) + (n-k-2) T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-2)^(n-1).

n	a(n)
1	1
2	1
3	-2
4	1
5	-11
6	4
7	1
8	-55
9	35
10	-8
11	1
12	-274
13	210
14	-91
15	16
16	1
17	-1368
18	986
19	-637
20	219
21	-32
22	1
23	-6837
24	3180
25	-3473
26	1752
27	-507
28	64
29	1
30	-34181
31	-1431
32	-17951
33	10543
34	-4563
35	1147
36	-128
37	1
38	-170900
39	-145310
40	-129950
41	48442
42	-30524
43	11470
44	-2555
45	256
46	1
47	-854494
48	-1726360
49	-1490890
50	-2314
51	-177832
52	84176
53	-28105
54	5627
55	-512

[1, 1, -2, 1, -11, 4, 1, -55, 35, -8, 1, -274, 210, -91, 16, 1, -1368, 986, -637, 219, -32, 1, -6837, 3180, -3473, 1752, -507, 64, 1, -34181, -1431, -17951, 10543, -4563, 1147, -128, 1, -170900, -145310, -129950, 48442, -30524, 11470, -2555, 256, 1, -854494, -1726360, -1490890, -2314, -177832, 84176, -28105, 5627, -512]

cp's OEIS Frontend

A306547 Triangle read by rows, defined by Riordan's general Eulerian recursion: T(n, k) = (k+3)T(n-1, k) + (n-k-2) T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-2)^(n-1).

Table of values

List of values

cp's OEIS Frontend

A306547 Triangle read by rows, defined by Riordan's general Eulerian recursion: T(n, k) = (k+3)*T(n-1, k) + (n-k-2) * T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-2)^(n-1).

Table of values

List of values

A306547 Triangle read by rows, defined by Riordan's general Eulerian recursion: T(n, k) = (k+3)T(n-1, k) + (n-k-2) T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-2)^(n-1).