Triangle read by rows: T(n,k) is the number of acyclic graphs on n unlabeled nodes whose longest directed path has k arcs.
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.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =3a(8) =2a(9) =0a(10) =1a(11) =8a(12) =14a(13) =8a(14) =0a(15) =1a(16) =20a(17) =89a(18) =128a(19) =64a(20) =0a(21) =1a(22) =55a(23) =634a(24) =1934a(25) =2336a(26) =1024a(27) =0a(28) =1a(29) =163
External references
- oeis: A350448