login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

COMMENTS

Rotations and reflections of the optimal arrangements are not counted separately.

LINKS

Table of n, a(n) for n=1..15.

Hugo Pfoertner, List of optimal arrangements for n<=15, Sep 02 2020.

Rainer Rosenthal, Catalogue with data for pictures n <= 15, October 2020.

Rainer Rosenthal, Pictures of all different solutions for n <= 15, October 2020.

EXAMPLE

See illustrations in Rosenthal link.

CROSSREFS

Cf. A336659, A337515.

Sequence in context: A331222 A089083 A102411 * A040245 A070538 A296336

Adjacent sequences:  A336779 A336780 A336781 * A336783 A336784 A336785

KEYWORD

nonn,hard,more

AUTHOR

Hugo Pfoertner, Aug 08 2020

EXTENSIONS

a(13)-a(15) from Hugo Pfoertner, Sep 02 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 27 17:25 EDT 2020. Contains 338035 sequences. (Running on oeis4.)