|
%I #15 Oct 07 2020 09:04:33
%S 1,1,1,1,1,16,5,1,1,4,12,8,24,2,1
%N a(n) is the number of essentially different optimal solutions with A336659(n) 1 X 1 squares to R. Kurchan's n-squares puzzle 577.
%C Rotations and reflections of the optimal arrangements are not counted separately.
%H Hugo Pfoertner, <a href="/A336782/a336782_1.txt">List of optimal arrangements for n<=15</a>, Sep 02 2020.
%H Rainer Rosenthal, <a href="/A336782/a336782_2.txt">Catalogue with data for pictures n <= 15</a>, October 2020.
%H Rainer Rosenthal, <a href="/A336782/a336782.pdf">Pictures of all different solutions for n <= 15</a>, October 2020.
%e See illustrations in Rosenthal link.
%Y Cf. A336659, A337515.
%K nonn,hard,more
%O 1,6
%A _Hugo Pfoertner_, Aug 08 2020
%E a(13)-a(15) from _Hugo Pfoertner_, Sep 02 2020
|
