|
%I #15 May 20 2014 23:38:15
%S 1,2,3,6,7,8,10,12,13,15,18,20,21,22,25,26,27,28,31,36,37,38,40,42,43,
%T 45,46,48,51,52,55,56,57,58,60,63,66,68,70,72,73,75,76,78,80,81,82,85,
%U 86,87,88,90,91,93,96,97,100,102,103,105,106,108,110,111,112,115,116,117,120
%N Square board sizes for which the lights-out problem has a unique solution (counting solutions differing only by rotation and reflection as distinct).
%C These are also the boards where any starting configuration can be turned off. - Robert Cowen (robert.cowen(AT)gmail.com), Jan 06 2007. [Comment corrected by Sune Kristian Jakobsen (sunejakobsen(AT)hotmail.com), Feb 04 2008]
%H N. J. A. Sloane and Thomas Buchholz, <a href="/A076436/b076436.txt">Table of n, a(n) for n = 1..1000</a> [terms were extended by N. J. A. Sloane (based on A117870), May 14 2006; terms 70 through 1000 were computed by Thomas Buchholz, May 16 2014]
%H K. Sutner, <a href="http://dx.doi.org/10.1007/BF03023823">Linear cellular automata and the Garden-of-Eden</a>, Math. Intelligencer, 11 (No. 2, 1989), 49-53.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/LightsOutPuzzle.html">Lights Out Puzzle</a>
%F Positive integer n is in this sequence iff A159257(n)=0. [_Max Alekseyev_, Sep 25 2009]
%Y Cf. A075462, A076437, A117872. Complement of A117870.
%K nonn
%O 1,2
%A _Eric W. Weisstein_, Oct 11 2002
%E More terms from _N. J. A. Sloane_ (based on A117870), May 14 2006, and _Thomas Buchholz_, May 16 2014
|
