A001419 Number of n-celled polyominoes with holes.
(Formerly M4226 N1767) 8
0, 0, 0, 0, 0, 0, 1, 6, 37, 195, 979, 4663, 21474, 96496, 425449, 1849252, 7946380, 33840946, 143060339, 601165888, 2513617990, 10466220315, 43425174374, 179630865835, 741123699012, 3050860717372 (list; graph; refs; listen; history; text; internal format)
S. W. Golomb, Polyominoes. Scribner's, NY, 1965; second edition ( Polyominoes: Puzzles, Packings, Problems and Patterns) Princeton Univ. Press, 1994.
Joseph S. Madachy, "Pentominoes - Some Solved and Unsolved Problems", J. Rec. Math., 2 (1969), 181-188.
George E. Martin, Polyominoes - A Guide to Puzzles and Problems in Tiling, The Mathematical Association of America, 1996
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Table of n, a(n) for n=1..26.
W. R. Muller, K. Szymanski, J. V. Knop, N. Trinajstic, On the number of square-cell configurations, Theor. Chim. Acta 86 (1993) 269-278.
Joseph Myers, Polyomino tiling
T. R. Parkin, L. J. Lander, and D. R. Parkin, Polyomino Enumeration Results, presented at SIAM Fall Meeting, 1967) and accompanying letter from T. J. Lander (annotated scanned copy).
R. C. Read, Contributions to the cell growth problem, Canad. J. Math., 14 (1962), 1-20.
Eric Weisstein's World of Mathematics, Polyomino.
a(n) >= A057418(n). - R. J. Mathar, Jun 15 2014
a(n) = A000105(n) - A000104(n). - Jean-François Alcover, Jan 04 2020, after R. J. Mathar in A000105.
A[s_] := With[{s6 = StringPadLeft[ToString[s], 6, "0"]}, Cases[ Import[ "https://oeis.org/A" <> s6 <> "/b" <> s6 <> ".txt", "Table"], {_, _}][[All, 2]]];
A000104 = A@104;
a[n_] := A000105[[n + 1]] - A000104[[n + 1]];
a /@ Range[26] (* Jean-François Alcover, Jan 04 2020 *)
Cf. A000104, A000105.
nonn,hard
N. J. A. Sloane.
More terms from Joseph Myers, May 05 2002
More terms from Joseph Myers, Nov 04 2003
a(24)-a(26) from Joseph Myers, Nov 17 2010