A075464 - cp's OEIS frontend

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.

n	a(n)
1	1
2	4
3	5
4	4
5	15
6	28
7	33
8	40
9	25
10	44
11	55
12	72
13	105
14	56
15	117
16	104
17	147
18	188
19	141
20	224
21	245
22	276
23	231
24	270
25	353
26	356
27	405
28	416
29	345
30	376
31	553
32	428
33	469
34	520
35	563
36	600
37	761
38	772
39	561
40	696
41	891
42	940
43	953
44	772
45	1069
46	1188
47	971
48	1096
49	1165
50	1220
51	1317
52	1256
53	1487
54	1400

[1, 4, 5, 4, 15, 28, 33, 40, 25, 44, 55, 72, 105, 56, 117, 104, 147, 188, 141, 224, 245, 276, 231, 270, 353, 356, 405, 416, 345, 376, 553, 428, 469, 520, 563, 600, 761, 772, 561, 696, 891, 940, 953, 772, 1069, 1188, 971, 1096, 1165, 1220, 1317, 1256, 1487, 1400]

cp's OEIS Frontend

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.

Table of values

List of values