Array read by antidiagonals: T(n,k) is the number of nonequivalent series-parallel networks with longest path of at most n edges and largest cut set of at most k edges.
A391484
Array read by antidiagonals: T(n,k) is the number of nonequivalent series-parallel networks with longest path of at most n edges and largest cut set of at most k edges.
Terms
- a(0) =1a(1) =2a(2) =2a(3) =3a(4) =7a(5) =3a(6) =4a(7) =18a(8) =18a(9) =4a(10) =5a(11) =42a(12) =87a(13) =42a(14) =5a(15) =6a(16) =90a(17) =396a(18) =396a(19) =90a(20) =6a(21) =7a(22) =186a(23) =1677a(24) =3503a(25) =1677a(26) =186a(27) =7a(28) =8a(29) =368
External references
- oeis: A391484