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

 

Logo

The submissions stack has been unacceptably high for several months now. Please voluntarily restrict your submissions and please help with the editing. (We don't want to have to impose further limits.)

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A144876 Maximal number of distinct 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 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>

%K nonn,more

%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 August 28 08:35 EDT 2015. Contains 261118 sequences.