login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of connected induced subgraphs in the n-polygon diagonal intersection graph.
2

%I #11 Mar 12 2018 03:22:45

%S 7,29,663,226796,425831705428,14890863004496474,

%T 26607736630371252198190410152638583648

%N Number of connected induced subgraphs in the n-polygon diagonal intersection graph.

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

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

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Vertex-InducedSubgraph.html">Vertex-Induced Subgraph</a>

%Y Cf. A300527.

%K nonn,more

%O 3,1

%A _Eric W. Weisstein_, Mar 08 2018

%E a(7)-a(9) from _Andrew Howroyd_, Mar 11 2018