Minimum possible number of cycles without repeated edges on a multigraph with 3 vertices and n edges (when each vertex pair must have at least one edge).
A263103
Minimum possible number of cycles without repeated edges on a multigraph with 3 vertices and n edges (when each vertex pair must have at least one edge).
Terms
- a(0) =1a(1) =3a(2) =8a(3) =28a(4) =103a(5) =415a(6) =2176a(7) =12888a(8) =77787a(9) =585411a(10) =4616376a(11) =37165472a(12) =359048127a(13) =3547499455a(14) =35666828200a(15) =418731250432
External references
- oeis: A263103