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”).

A290784
Number of (non-null) connected induced subgraphs in the n-triangular honeycomb obtuse knight graph.
0
1, 3, 6, 19, 213, 379687, 80990506, 22635546606
OFFSET
1,2
LINKS
Eric Weisstein's World of Mathematics, Connected Graph
Eric Weisstein's World of Mathematics, Vertex-Induced Subgraph
MATHEMATICA
Table[With[{g = GraphData[{"TriangularHoneycombObtuseKnight", n}]}, Count[Subgraph[g, #] & /@ Rest[Subsets[VertexList[g]]], _?ConnectedGraphQ]], {n, 5}]
Table[With[{g = GraphData[{"TriangularHoneycombObtuseKnight", n}]}, Total[Boole[ConnectedGraphQ[Subgraph[g, #]]] & /@ Rest[Subsets[VertexList[g]]]]], {n, 5}]
CROSSREFS
Sequence in context: A269306 A326317 A306522 * A355605 A356912 A176993
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Aug 10 2017
EXTENSIONS
a(8) from Andrew Howroyd, Aug 15 2017
a(2)-a(5) corrected by Eric W. Weisstein, Aug 27 2017
STATUS
approved