login
Number of (undirected) cycles in the n-triangular honeycomb obtuse knight graph.
0

%I #5 May 14 2019 22:04:14

%S 0,0,0,0,15,8908,7451436

%N Number of (undirected) cycles in the n-triangular honeycomb obtuse knight graph.

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

%K nonn,more

%O 1,5

%A _Eric W. Weisstein_, May 14 2019