A381058 - cp's OEIS frontend

A381058 Irregular triangular array read by rows. Let S_n be the set of labeled graphs G on [n] with 2-colored nodes where black nodes are only connected to white nodes and vice versa. Orient the edges in each such graph G from black to white. T(n,k) is the number of graphs in S_n containing exactly k descents, n>=0, 0<=k<=A002620(n).

n	a(n)
0	1
1	2
2	5
3	1
4	16
5	8
6	2
7	67
8	56
9	30
10	8
11	1
12	374
13	436
14	358
15	188
16	68
17	16
18	2
19	2825
20	4143
21	4508
22	3460
23	2032
24	924
25	320
26	80
27	13
28	1
29	29212
30	50460
31	66976
32	66092
33	52412
34	34280
35	18630
36	8376
37	3072
38	892
39	194
40	28
41	2
42	417199
43	811790
44	1246486
45	1471358
46	1436404
47	1195166
48	859650
49	537750
50	292880
51	138280
52	56048
53	19168
54	5382
55	1188
56	192
57	20
58	1

[1, 2, 5, 1, 16, 8, 2, 67, 56, 30, 8, 1, 374, 436, 358, 188, 68, 16, 2, 2825, 4143, 4508, 3460, 2032, 924, 320, 80, 13, 1, 29212, 50460, 66976, 66092, 52412, 34280, 18630, 8376, 3072, 892, 194, 28, 2, 417199, 811790, 1246486, 1471358, 1436404, 1195166, 859650, 537750, 292880, 138280, 56048, 19168, 5382, 1188, 192, 20, 1]

cp's OEIS Frontend

Table of values

List of values