A340798 - cp's OEIS frontend

A340798 Square array read by descending antidiagonals. Let G be a simple labeled graph on n nodes. T(n,k) is the number of ways to give G an acyclic orientation and a coloring function C:V(G) -> {1,2,...,k} so that u->v implies C(u) >= C(v) for all u,v in V(G), n >= 0, k >= 0.

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	2
8	3
9	0
10	1
11	3
12	10
13	25
14	0
15	1
16	4
17	21
18	122
19	543
20	0
21	1
22	5
23	36
24	339
25	3550
26	29281
27	0
28	1
29	6
30	55
31	724
32	12477
33	241442
34	3781503
35	0
36	1
37	7
38	78
39	1325
40	32316
41	1035843
42	37717630
43	1138779265
44	0

[1, 1, 0, 1, 1, 0, 1, 2, 3, 0, 1, 3, 10, 25, 0, 1, 4, 21, 122, 543, 0, 1, 5, 36, 339, 3550, 29281, 0, 1, 6, 55, 724, 12477, 241442, 3781503, 0, 1, 7, 78, 1325, 32316, 1035843, 37717630, 1138779265, 0]

cp's OEIS Frontend

A340798 Square array read by descending antidiagonals. Let G be a simple labeled graph on n nodes. T(n,k) is the number of ways to give G an acyclic orientation and a coloring function C:V(G) -> {1,2,...,k} so that u->v implies C(u) >= C(v) for all u,v in V(G), n >= 0, k >= 0.

Table of values

List of values