|
%I #9 Jan 23 2019 20:00:53
%S 1,0,1,2,1,1,0,0,2,5,12,6,5,1,1,0,0,0,5,12,35,108,73,76,80,25,15,15,0,
%T 0,0,0,12,35,108,369,1285,1044,1475,2205,2643,983,1050,1208,958,0,0,0,
%U 0,0,35,108,369,1285,4655,17073,15980,26548,48766,79579,99860,45898,60433,89890,109424,84312,0,0,0,0,0,0,108,369,1285,4655,17073,63600,238591,245955,458397,948201,1857965,3160371,4153971,2217787,3402761,5855953,9067535,11402651,9170285,0,0,0,0,0,0,0,369,1285,4655,17073,63600,238591,901971,3426576,3807508,7710844,17354771,37983463
%N Triangle read by rows: T(n,k) (n>=1) gives the number of n-indecomposable polyominoes with k cells (k >= n).
%C A polyomino is called n-indecomposable if it cannot be partitioned (along cell boundaries) into two or more polyominoes each with at least n cells.
%C Row n has 4n-3 terms of which the first n-1 are zero.
%C For full lists of drawings of these polyominoes for n <= 6, see the links in A125759.
%H N. MacKinnon, <a href="http://www.jstor.org/stable/3618845">Some thoughts on polyomino tilings</a>, Math. Gaz., 74 (1990), 31-33.
%H Simone Rinaldi and D. G. Rogers, <a href="http://www.jstor.org/stable/27821767">Indecomposability: polyominoes and polyomino tilings</a>, The Mathematical Gazette 92.524 (2008): 193-204.
%e Triangle begins:
%e 1
%e 0,1,2,1,1
%e 0,0,2,5,12,6,5,1,1
%e 0,0,0,5,12,35,108,73,76,80,25,15,15
%e 0,0,0,0,12,35,108,369,1285,1044,1475,2205,2643,983,1050,1208,958
%e 0,0,0,0,0,35,108,369,1285,4655,17073,15980,26548,48766,79579,99860,45898,60433,89890,109424,84312
%e 0,0,0,0,0,0,108,369,1285,4655,17073,63600,238591,245955,458397,948201,1857965,3160371,4153971,2217787,3402761,5855953,9067535,11402651,9170285
%e 0,0,0,0,0,0,0,369,1285,4655,17073,63600,238591,901971,3426576,3807508,7710844,17354771,37983463,...
%Y Row sums give A125709. Cf. A125759, A125761, A126742, A126743.
%K nonn,tabf
%O 1,4
%A _David Applegate_ and _N. J. A. Sloane_, Feb 04 2007, Feb 14 2007
%E Rows 5, 6, 7 and 8 from _David Applegate_, Feb 16 2007
|
