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

A027683
Number of independent vertex sets of the n X n torus grid graph.
21
1, 7, 34, 743, 25531, 2406862, 464483559, 213256442503, 215560806324388, 498819827260367617, 2590618817013278596997, 30496896080418683388380966, 809724336154415150287031740151, 48609694845429192825410114233405807, 6589876632329358971395398453738256596574, 2018670118781080042934952855192359574137313799
OFFSET
1,2
LINKS
Vaclav Kotesovec, Non-attacking chess pieces, 6ed, 2013, p. 73, 405.
Eric Weisstein's World of Mathematics, Independent Vertex Set
Eric Weisstein's World of Mathematics, Torus Grid Graph
MATHEMATICA
a[n_] := With[{sets = Select[Tuples[{0, 1}, n], Count[#*RotateLeft[#], 1] == 0 &]}, Tr[MatrixPower[Table[Boole[Count[s1*s2, 1] == 0], {s1, sets}, {s2, sets}], n]]];
Table[a[n], {n, 1, 10}] (* Pjotr Buys, Jun 07 2023 *)
CROSSREFS
Cf. A006506 for flat version.
Sequence in context: A027842 A232043 A360506 * A196968 A000829 A247158
KEYWORD
nonn,nice,hard
AUTHOR
EXTENSIONS
Terms a(14)-a(16) from Vaclav Kotesovec, Dec 02 2011
STATUS
approved