login

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”).

Number of fixed strictly disconnected n-ominoes bounded (not necessarily tightly) by an n*n square
0

%I #2 Mar 31 2012 10:23:10

%S 0,2,42,937,26427,937126,40290848,2036152559,118202398712,

%T 7747410863508,565695467280668,45525704815211707,4002930269942820774,

%U 381750656962679848234,39244733577786597223238

%N Number of fixed strictly disconnected n-ominoes bounded (not necessarily tightly) by an n*n square

%C a(n) = A162676(n) - A001168(n)

%e a(2)=2: the two rotations of the disconnected domino consisting of two squares connected at a vertex

%Y Cf. A162676, A001168, A006770, A030222

%K nonn

%O 1,2

%A _David Bevan_, Jul 28 2009