login
Number of chordless cycles of length >=4 in the n-diagonal intersection graph.
1

%I #7 Apr 02 2024 14:34:18

%S 0,1,17,166,50684,2395992

%N Number of chordless cycles of length >=4 in the n-diagonal intersection graph.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ChordlessCycle.html">Chordless Cycle</a>

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/PolygonDiagonalIntersectionGraph.html">Polygon Diagonal Intersection Graph</a>

%Y Cf. A371340 (chordless cycle polynomial).

%K nonn,more

%O 3,3

%A _Eric W. Weisstein_, Apr 24 2023