A350448 - cp's OEIS frontend

A350448 Triangle read by rows: T(n,k) is the number of acyclic graphs on n unlabeled nodes whose longest directed path has k arcs.

n	a(n)
0	1
1	1
2	0
3	1
4	1
5	0
6	1
7	3
8	2
9	0
10	1
11	8
12	14
13	8
14	0
15	1
16	20
17	89
18	128
19	64
20	0
21	1
22	55
23	634
24	1934
25	2336
26	1024
27	0
28	1
29	163
30	5668
31	36428
32	83648
33	84992
34	32768
35	0
36	1
37	556
38	67926
39	959718
40	3919584
41	7097088
42	6144000
43	2097152
44	0
45	1
46	2222
47	1137641
48	37205922
49	268989920
50	793138688
51	1175224320
52	880803840
53	268435456
54	0

[1, 1, 0, 1, 1, 0, 1, 3, 2, 0, 1, 8, 14, 8, 0, 1, 20, 89, 128, 64, 0, 1, 55, 634, 1934, 2336, 1024, 0, 1, 163, 5668, 36428, 83648, 84992, 32768, 0, 1, 556, 67926, 959718, 3919584, 7097088, 6144000, 2097152, 0, 1, 2222, 1137641, 37205922, 268989920, 793138688, 1175224320, 880803840, 268435456, 0]

cp's OEIS Frontend

A350448 Triangle read by rows: T(n,k) is the number of acyclic graphs on n unlabeled nodes whose longest directed path has k arcs.

Table of values

List of values