login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A336782
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.
3
1, 1, 1, 1, 1, 16, 5, 1, 1, 4, 12, 8, 24, 2, 1
OFFSET
1,6
COMMENTS
Rotations and reflections of the optimal arrangements are not counted separately.
LINKS
EXAMPLE
See illustrations in Rosenthal link.
CROSSREFS
Sequence in context: A089083 A363191 A102411 * A040245 A070538 A296336
KEYWORD
nonn,hard,more
AUTHOR
Hugo Pfoertner, Aug 08 2020
EXTENSIONS
a(13)-a(15) from Hugo Pfoertner, Sep 02 2020
STATUS
approved