A329228 - cp's OEIS frontend

A329228 Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled vertices such that every vertex has outdegree k, n >= 1, 0 <= k < n.

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	1
7	1
8	6
9	6
10	1
11	1
12	13
13	79
14	13
15	1
16	1
17	40
18	1499
19	1499
20	40
21	1
22	1
23	100
24	35317
25	257290
26	35317
27	100
28	1
29	1
30	291
31	967255
32	56150820
33	56150820
34	967255
35	291
36	1
37	1
38	797
39	29949217
40	14971125930
41	111359017198
42	14971125930
43	29949217
44	797
45	1

[1, 1, 1, 1, 2, 1, 1, 6, 6, 1, 1, 13, 79, 13, 1, 1, 40, 1499, 1499, 40, 1, 1, 100, 35317, 257290, 35317, 100, 1, 1, 291, 967255, 56150820, 56150820, 967255, 291, 1, 1, 797, 29949217, 14971125930, 111359017198, 14971125930, 29949217, 797, 1]

cp's OEIS Frontend

A329228 Triangle read by rows: T(n,k) is the number of digraphs on n unlabeled vertices such that every vertex has outdegree k, n >= 1, 0 <= k < n.

Table of values

List of values