a(n) is the minimal number of nontrivial switch flippings needed to solve the all-ones lights out problem on an n X n square.
A075464
a(n) is the minimal number of nontrivial switch flippings needed to solve the all-ones lights out problem on an n X n square.
Terms
- a(0) =1a(1) =4a(2) =5a(3) =4a(4) =15a(5) =28a(6) =33a(7) =40a(8) =25a(9) =44a(10) =55a(11) =72a(12) =105a(13) =56a(14) =117a(15) =104a(16) =147a(17) =188a(18) =141a(19) =224a(20) =245a(21) =276a(22) =231a(23) =270a(24) =353a(25) =356a(26) =405a(27) =416a(28) =345a(29) =376
External references
- oeis: A075464