A381102 - cp's OEIS frontend

A381102 Irregular triangle read by rows. For each j, 1<=j<=n properly color the vertices of a labeled graph on [n] using each of the first j colors in the color set {c1 Orient the edges according to the strict order on the colors. T(n,k) is the number of such directed graphs containing k descents, n>=0, 0<=k<=binomial(n,2).

n	a(n)
0	1
1	1
2	4
3	1
4	36
5	27
6	9
7	1
8	696
9	983
10	731
11	330
12	93
13	15
14	1
15	27808
16	60615
17	72662
18	59113
19	35197
20	15731
21	5269
22	1287
23	216
24	22
25	1
26	2257888
27	6803655
28	11412586
29	13504721
30	12316799
31	9026017
32	5427090
33	2700863
34	1112555
35	376459
36	103002
37	22203
38	3619
39	417
40	30
41	1

[1, 1, 4, 1, 36, 27, 9, 1, 696, 983, 731, 330, 93, 15, 1, 27808, 60615, 72662, 59113, 35197, 15731, 5269, 1287, 216, 22, 1, 2257888, 6803655, 11412586, 13504721, 12316799, 9026017, 5427090, 2700863, 1112555, 376459, 103002, 22203, 3619, 417, 30, 1]

cp's OEIS Frontend

Table of values

List of values