Triangle read by rows: T(n,k) is the number of hypergraphs on n labeled nodes that have exactly k isolated points, n>=0, 0<=k<=n.
A285641
Triangle read by rows: T(n,k) is the number of hypergraphs on n labeled nodes that have exactly k isolated points, n>=0, 0<=k<=n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =5a(4) =2a(5) =1a(6) =109a(7) =15a(8) =3a(9) =1a(10) =32297a(11) =436a(12) =30a(13) =4a(14) =1a(15) =2147321017a(16) =161485a(17) =1090a(18) =50a(19) =5a(20) =1a(22) =12883926102a(23) =484455a(24) =2180a(25) =75a(26) =6a(27) =1a(30) =45093741357a(31) =1130395a(32) =3815
External references
- oeis: A285641