login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A144876 Maximal number of unique polyominos into which an n X n square can be divided. 0

%I

%S 1,2,4,5,8,10,13,16

%N Maximal number of unique 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>

%K nonn

%O 1,2

%A Ken Duisenberg (Ken.Duisenberg(AT)hp.com), Sep 24 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 20 21:20 EST 2014. Contains 249754 sequences.