A121150 - OEIS

The OEIS is supported by the many generous donors to the OEIS 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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A121150

Minimal number of vertices in an n-polyomino.

%I #8 Aug 25 2021 16:53:18

%S 4,6,8,9,11,12,14,15,16,18,19,20,22,23,24,25,27,28

%N Minimal number of vertices in an n-polyomino.

%C It appears that a(n) = A080037[n] = n + Floor[Sqrt[4n-3]] + 2 for n>0.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Polyomino.html">Polyomino</a>.

%Y Cf. A080037.

%K nonn,more

%O 1,1

%A _Alexander Adamchuk_, Aug 12 2006

%E a(17)-a(18) from _John Mason_, Aug 14 2021