A157012 - cp's OEIS frontend

A157012 Riordan's general Eulerian recursion: T(n,k) = (k+2)T(n-1, k) + (n-k) T(n-1, k-1), with T(n,0) = 1, T(n,n) = 0.

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	5
8	1
9	0
10	1
11	18
12	14
13	1
14	0
15	1
16	58
17	110
18	33
19	1
20	0
21	1
22	179
23	672
24	495
25	72
26	1
27	0
28	1
29	543
30	3583
31	5163
32	1917
33	151
34	1
35	0
36	1
37	1636
38	17590
39	43730
40	32154
41	6808
42	310
43	1
44	0
45	1
46	4916
47	81812
48	324190
49	411574
50	176272
51	22904
52	629
53	1
54	0

[1, 1, 0, 1, 1, 0, 1, 5, 1, 0, 1, 18, 14, 1, 0, 1, 58, 110, 33, 1, 0, 1, 179, 672, 495, 72, 1, 0, 1, 543, 3583, 5163, 1917, 151, 1, 0, 1, 1636, 17590, 43730, 32154, 6808, 310, 1, 0, 1, 4916, 81812, 324190, 411574, 176272, 22904, 629, 1, 0]

cp's OEIS Frontend

A157012 Riordan's general Eulerian recursion: T(n,k) = (k+2)T(n-1, k) + (n-k) T(n-1, k-1), with T(n,0) = 1, T(n,n) = 0.

Table of values

List of values

cp's OEIS Frontend

A157012 Riordan's general Eulerian recursion: T(n,k) = (k+2)*T(n-1, k) + (n-k) * T(n-1, k-1), with T(n,0) = 1, T(n,n) = 0.

Table of values

List of values

A157012 Riordan's general Eulerian recursion: T(n,k) = (k+2)T(n-1, k) + (n-k) T(n-1, k-1), with T(n,0) = 1, T(n,n) = 0.