|
%I #2 Mar 30 2012 19:00:33
%S 1,4,5,12,15,28,33,40,55,44,71,72,105,96,117,152,147,188,225,224,245,
%T 276,299,306,353,356,405,416,451
%N a(n) is the maximal (nonredundant) number of switch flippings in a solution of the all-ones lights out problem on an n X n square.
%D See A075462 for references.
%Y Cf. A075464.
%K hard,nonn
%O 1,2
%A _Jacob A. Siehler_, Apr 27 2008
|
