Number of distinct cycles without repeated edges on the multigraph with 2 vertices connected by n edges.
A263102
Number of distinct cycles without repeated edges on the multigraph with 2 vertices connected by n edges.
Terms
- a(0) =0a(1) =0a(2) =1a(3) =3a(4) =12a(5) =40a(6) =225a(7) =1071a(8) =8848a(9) =56232a(10) =616185a(11) =4880755a(12) =66475596a(13) =629398848a(14) =10238194057a(15) =112690225935
External references
- oeis: A263102