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”).
%I #29 Feb 11 2024 09:15:17
%S 1,3,1,1,1,27,2,28,32,1,27,27,1,27,27,1,27,27,1,27,27,1,27,27,1,27,27,
%T 1,27,27,1,27,27,1,27,27,1,27
%N Number of maximum independent vertex sets in the n-triangular grid graph.
%H John Machacek, <a href="https://arxiv.org/abs/2010.11112">Unique maximum independent sets in graphs on monomials of a fixed degree</a>, arXiv:2010.11112 [math.CO], 2020-2021. See Theorem 2.1 p. 4.
%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="http://mathworld.wolfram.com/MaximumIndependentVertexSet.html">Maximum Independent Vertex Set</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/TriangularGridGraph.html">Triangular Grid Graph</a>
%F Conjecture: a(n) = a(n-3) for n >= 12. - _Andrew Howroyd_, Jan 01 2018
%F a(3k) = 1 for all k != 2. - _John Machacek_, May 01 2021
%Y Cf. A027740, A197564, A239438.
%K nonn,more
%O 0,2
%A _Eric W. Weisstein_, Dec 31 2017
%E a(11)-a(24) from _Andrew Howroyd_, Jan 01 2018
%E a(25)-a(37) from _Eric W. Weisstein_, Feb 10 2024