login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126141 Maximum odd-order of a polyomino with n cells that tiles a rectangle with an odd number of congruent copies. 3

%I #2 Mar 30 2012 18:39:49

%S 1,1,15,1,45,21,153,1

%N Maximum odd-order of a polyomino with n cells that tiles a rectangle with an odd number of congruent copies.

%C The odd-order of a polyomino is defined as the minimum odd number of congruent copies required to tile a rectangle. The odd-order is undefined if the polyomino cannot tile a rectangle with an odd number of congruent copies. No example of a non-rectangular polyomino is known for which odd-order = order.

%D S. W. Golomb, Polyominoes, second edition, Chapter 8, pp. 97-110, Princeton University Press, 1994.

%H M. Reid, <a href="http://www.math.ucf.edu/~reid/Polyomino/rectifiable.html">Rectifiable polyomino page</a>.

%Y Cf. A126138, A126139, A126140.

%K hard,more,nonn

%O 1,3

%A _William Rex Marshall_, Dec 19 2006

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 04:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)