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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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

%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 | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 10 07:27 EST 2016. Contains 278993 sequences.