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”).
%I #15 Mar 09 2019 00:22:22
%S 1,2,4,5,8,10,13,16,19,22,26,30,34,38
%N Maximal number of distinct polyominoes into which an n X n square can be divided.
%C Found as a solution for Ken Duisenberg's Puzzle of the Week, archived September 12, 2008.
%C 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
%H Ken Duisenberg, <a href="http://ken.duisenberg.com/potw/archive/arch08/080912sol.html">Puzzle of the Week: September 12, 2008</a>
%H Charlie Neder, <a href="/A144876/a144876.png">Example dissections for n = 9, 10, 11, 12</a>
%K nonn,more
%O 1,2
%A Ken Duisenberg (Ken.Duisenberg(AT)hp.com), Sep 24 2008
%E a(9)-a(14) from _Charlie Neder_, Mar 06 2019