login
Number of (non-null) connected induced subgraphs in the n-Sierpinski sieve graph.
2

%I #7 Sep 09 2017 03:21:25

%S 7,47,6306,16719440487,484190291407629184897238968930

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

%C Term a(6) has 89 decimal digits and a(7) has 265. - _Andrew Howroyd_, Sep 08 2017

%H Andrew Howroyd, <a href="/A292067/b292067.txt">Table of n, a(n) for n = 1..7</a>

%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/SierpinskiSieveGraph.html">Sierpinski Sieve Graph</a>

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

%K nonn

%O 1,1

%A _Eric W. Weisstein_, Sep 08 2017

%E a(4)-a(5) from _Andrew Howroyd_, Sep 08 2017