A339590 - cp's OEIS frontend

A339590 Irregular triangle read by rows: T(n,k) (n>=2, k>=1) = number of strong tournaments on n nodes with k descents.

n	a(n)
2	0
3	1
4	1
5	1
6	6
7	10
8	6
9	1
10	1
11	13
12	56
13	123
14	158
15	123
16	56
17	13
18	1
19	1
20	22
21	172
22	717
23	1910
24	3547
25	4791
26	4791
27	3547
28	1910
29	717
30	172
31	22
32	1
33	1
34	33
35	402
36	2674
37	11614
38	36293
39	86305
40	161529
41	242890
42	297003
43	297003
44	242890
45	161529
46	86305
47	36293
48	11614
49	2674
50	402
51	33
52	1

[0, 1, 1, 1, 6, 10, 6, 1, 1, 13, 56, 123, 158, 123, 56, 13, 1, 1, 22, 172, 717, 1910, 3547, 4791, 4791, 3547, 1910, 717, 172, 22, 1, 1, 33, 402, 2674, 11614, 36293, 86305, 161529, 242890, 297003, 297003, 242890, 161529, 86305, 36293, 11614, 2674, 402, 33, 1]

cp's OEIS Frontend

A339590 Irregular triangle read by rows: T(n,k) (n>=2, k>=1) = number of strong tournaments on n nodes with k descents.

Table of values

List of values