|
|
A144876
|
|
Maximal number of distinct polyominoes into which an n X n square can be divided.
|
|
1
|
|
|
1, 2, 4, 5, 8, 10, 13, 16, 19, 22, 26, 30, 34, 38
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Found as a solution for Ken Duisenberg's Puzzle of the Week, archived September 12, 2008.
The maximal cardinality of a set of distinct polyominoes with total area n^2 is an upper bound, and I conjecture that this bound is always attainable. - Charlie Neder, Mar 06 2019
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Ken Duisenberg (Ken.Duisenberg(AT)hp.com), Sep 24 2008
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|