Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 4500 articles have referenced us, often saying "we would not have discovered this result without the OEIS".
%N Maximal number of distinct polyominos 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.
%H <a href="http://ken.duisenberg.com/potw/archive/arch08/080912sol.html">Ken Duisenberg's Puzzle of the Week: September 12, 2008</a>
%A Ken Duisenberg (Ken.Duisenberg(AT)hp.com), Sep 24 2008