A135021 - cp's OEIS frontend

A135021 Triangle read by rows: T(n,r) = number of maximum r-uniform acyclic hypergraphs of order n and size n-r+1, 1 <= r <= n+1.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	1
6	1
7	3
8	1
9	1
10	1
11	16
12	6
13	1
14	1
15	1
16	125
17	70
18	10
19	1
20	1
21	1
22	1296
23	1215
24	200
25	15
26	1
27	1
28	1
29	16807
30	27951
31	5915
32	455
33	21
34	1
35	1
36	1
37	262144
38	799708
39	229376
40	20230
41	896
42	28
43	1
44	1
45	1
46	4782969
47	27337500
48	10946964
49	1166886
50	55566
51	1596
52	36
53	1
54	1
55	1
56	100000000
57	1086190605
58	618435840
59	82031250
60	4429152
61	131250
62	2640
63	45
64	1
65	1

[1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 16, 6, 1, 1, 1, 125, 70, 10, 1, 1, 1, 1296, 1215, 200, 15, 1, 1, 1, 16807, 27951, 5915, 455, 21, 1, 1, 1, 262144, 799708, 229376, 20230, 896, 28, 1, 1, 1, 4782969, 27337500, 10946964, 1166886, 55566, 1596, 36, 1, 1, 1, 100000000, 1086190605, 618435840, 82031250, 4429152, 131250, 2640, 45, 1, 1]

cp's OEIS Frontend

A135021 Triangle read by rows: T(n,r) = number of maximum r-uniform acyclic hypergraphs of order n and size n-r+1, 1 <= r <= n+1.

Table of values

List of values