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 chordless cycles in the n-triangular honeycomb acute knight graph.
0

%I #6 Feb 12 2024 08:34:26

%S 0,0,0,0,0,0,1,3,9,25,69,201,620,1923,6339,22238,82443,333723,1490051,

%T 7241421

%N Number of chordless cycles in the n-triangular honeycomb acute knight graph.

%H Stan Wagon, <a href="http://www.jstor.org/stable/10.4169/college.math.j.45.4.278">Graph Theory Problems from Hexagonal and Traditional Chess</a>, The College Mathematics Journal, Vol. 45, No. 4, September 2014, pp. 278-287.

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

%K nonn,more

%O 1,8

%A _Eric W. Weisstein_, Feb 12 2024