The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A234013 Number of maximally biased free polyominoes with n squares. 1
1, 1, 2, 1, 1, 11, 8, 3, 1, 79, 36, 8, 2, 540, 164, 31, 4, 3174, 749, 106, 11, 17443, 3312, 397, 27 (list; graph; refs; listen; history; text; internal format)



Define the bias of a polyomino to be the difference between the number of black squares and the number of white squares when chessboard coloring is applied to the polyomino. Maximally biased polyominoes of size n are those sharing the maximum value of bias among all polyominoes of n squares. For n = 4m + 1, for integer m, all maximally biased polyominoes may be built starting with a monomino and then successively adding "airplane" tetrominoes.


Table of n, a(n) for n=1..25.

John Mason, Chessboard coloured polyominoes and bias

Herman Tulleken, Polyominoes 2.2: How they fit together, (2019).


Cf. A000105, A106249, A001933, A234012.

Sequence in context: A297544 A297802 A232266 * A158202 A176307 A197648

Adjacent sequences:  A234010 A234011 A234012 * A234014 A234015 A234016




John Mason, Dec 27 2013


More terms from John Mason, Jan 03 2015



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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 01:13 EST 2021. Contains 349435 sequences. (Running on oeis4.)