login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
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
CROSSREFS
Sequence in context: A115793 A076614 A227800 * A337483 A239517 A231056
KEYWORD
nonn,more
AUTHOR
Ken Duisenberg (Ken.Duisenberg(AT)hp.com), Sep 24 2008
EXTENSIONS
a(9)-a(14) from Charlie Neder, Mar 06 2019
STATUS
approved