cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A297557 Number of maximum independent vertex sets in the n-triangular grid graph.

This page as a plain text file.
%I A297557 #30 Feb 16 2025 08:33:52
%S A297557 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 A297557 1,27,27,1,27,27,1,27,27,1,27
%N A297557 Number of maximum independent vertex sets in the n-triangular grid graph.
%H A297557 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 A297557 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 A297557 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MaximumIndependentVertexSet.html">Maximum Independent Vertex Set</a>
%H A297557 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TriangularGridGraph.html">Triangular Grid Graph</a>
%F A297557 Conjecture: a(n) = a(n-3) for n >= 12. - _Andrew Howroyd_, Jan 01 2018
%F A297557 a(3k) = 1 for all k != 2. - _John Machacek_, May 01 2021
%Y A297557 Cf. A027740, A197564, A239438.
%K A297557 nonn,more
%O A297557 0,2
%A A297557 _Eric W. Weisstein_, Dec 31 2017
%E A297557 a(11)-a(24) from _Andrew Howroyd_, Jan 01 2018
%E A297557 a(25)-a(37) from _Eric W. Weisstein_, Feb 10 2024