Number of nonequivalent essentially series series-parallel networks with longest path at most n edges and largest cut set of at most 2 edges.
A391486
Number of nonequivalent essentially series series-parallel networks with longest path at most n edges and largest cut set of at most 2 edges.
Terms
- a(0) =1a(1) =4a(2) =12a(3) =32a(4) =75a(5) =165a(6) =340a(7) =674a(8) =1289a(9) =2403a(10) =4375a(11) =7825a(12) =13759a(13) =23859a(14) =40837a(15) =69111a(16) =115718a(17) =191925a(18) =315461a(19) =514274a(20) =831880a(21) =1335960a(22) =2130822a(23) =3376877a(24) =5318964a(25) =8329795a(26) =12973283a(27) =20100004a(28) =30986336a(29) =47541630
External references
- oeis: A391486