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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

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 September 17 13:36 EDT 2014. Contains 246846 sequences.