Tag: Integer sequences
-
Tilings and Integer Programming
This is the story behind sequence A355477 from the Online Encyclopedia of Integer Sequences. Let’s say you have an unlimited supply of “zig-zag” Tetris pieces: How many can you pack into an n x n square? For example, if you’re trying to fill a 4×4 square, then you can fit three such pieces: but, try…