login
Number of (non-null) connected induced subgraphs in the n-flower graph.
1

%I #10 Feb 16 2025 08:34:05

%S 179972,1809558,18324824

%N Number of (non-null) connected induced subgraphs in the n-flower graph.

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

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

%F a(n) = 16^n - A362793(n) - 1.

%Y Cf. A362793 (number of vertex cuts).

%K nonn,more,bref,changed

%O 5,1

%A _Eric W. Weisstein_, May 04 2023