login
Positive integers n such that the toric n X n "Lights Out" puzzle has a unique solution (up to the order of flippings; each flipping appears at most once).
2

%I #8 Jan 21 2020 00:14:29

%S 1,2,4,7,8,11,13,14,16,19,22,23,26,28,29,32,37,38,41,43,44,46,47,49,

%T 52,53,56,58,59,61,64,67,71,73,74,76,77,79,82,83,86,88,89,91,92,94,97,

%U 98,101,103,104,106,107,109,112,113,116,118,121,122,128,131,133,134,137

%N Positive integers n such that the toric n X n "Lights Out" puzzle has a unique solution (up to the order of flippings; each flipping appears at most once).

%C Complement to the sequence A165740 in the set of positive integers.

%D See A165738 for the references.

%H Max Alekseyev and Thomas Buchholz, <a href="/A165741/b165741.txt">Table of n, a(n) for n = 1..1000</a> [terms 66 through 1000 were computed by Thomas Buchholz, May 20 2014]

%F n is in this sequence iff A165738(n)=0.

%Y Cf. A159257, A075462, A076436, A165740.

%K nonn

%O 1,2

%A _Max Alekseyev_, Sep 25 2009

%E More terms from _Thomas Buchholz_, May 20 2014