login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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. 1
1, 2, 4, 5, 8, 10, 13, 16, 19, 22, 26, 30, 34, 38 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Found as a solution for Ken Duisenberg's Puzzle of the Week, archived September 12, 2008.
The maximal cardinality of a set of distinct polyominoes with total area n^2 is an upper bound, and I conjecture that this bound is always attainable. - Charlie Neder, Mar 06 2019
LINKS
CROSSREFS
Sequence in context: A115793 A076614 A227800 * A337483 A239517 A231056
KEYWORD
nonn,more
AUTHOR
Ken Duisenberg (Ken.Duisenberg(AT)hp.com), Sep 24 2008
EXTENSIONS
a(9)-a(14) from Charlie Neder, Mar 06 2019
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 06:21 EDT 2024. Contains 370953 sequences. (Running on oeis4.)