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!)
A361225 Maximum number of ways in which a set of integer-sided rectangular pieces can tile an n X 3 rectangle, up to rotations and reflections. 4
1, 5, 8, 95, 682, 4801, 33807 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
The following table shows the sets of pieces that give the maximum number of tilings for n <= 7. The solutions are unique except for n = 1 and n = 3.
\ Number of pieces of size
n \ 1 X 1 | 1 X 2 | 1 X 3
---+-------+-------+------
1 | 3 | 0 | 0
1 | 1 | 1 | 0
1 | 0 | 0 | 1
2 | 2 | 2 | 0
3 | 3 | 3 | 0
3 | 2 | 2 | 1
4 | 3 | 3 | 1
5 | 4 | 4 | 1
6 | 7 | 4 | 1
7 | 8 | 5 | 1
It seems that all optimal solutions for A361219 are also optimal here, but for n = 1 and n = 3 there are other optimal solutions.
CROSSREFS
Third column of A361221.
Sequence in context: A101016 A264295 A025518 * A356826 A267003 A151827
KEYWORD
nonn,more
AUTHOR
STATUS
approved

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 April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)