|
|
A126743
|
|
Triangle read by rows: T(n,k) (n>=1) gives the number of n-indecomposable polyominoes with k cells (k >= 2n).
|
|
5
|
|
|
0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 6, 5, 1, 1, 0, 0, 0, 0, 0, 0, 0, 73, 76, 80, 25, 15, 15, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1044, 1475, 2205, 2643, 983, 1050, 1208, 958, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 15980, 26548, 48766, 79579, 99860, 45898, 60433, 89890, 109424, 84312, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 245955, 458397, 948201, 1857965, 3160371, 4153971, 2217787, 3402761, 5855953, 9067535, 11402651, 9170285, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3807508, 7710844, 17354771, 37983463
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,12
|
|
COMMENTS
|
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.
Row n has 4n-3 terms of which the first 2n-1 are zero.
For full lists of drawings of these polyominoes for n <= 6, see the links in A125759.
|
|
LINKS
|
|
|
EXAMPLE
|
Triangle begins:
0
0,0,0,1,1
0,0,0,0,0,6,5,1,1
0,0,0,0,0,0,0,73,76,80,25,15,15
0,0,0,0,0,0,0,0,0,1044,1475,2205,2643,983,1050,1208,958
0,0,0,0,0,0,0,0,0,0,0,15980,26548,48766,79579,99860,45898,60433,89890,109424,84312
0,0,0,0,0,0,0,0,0,0,0,0,0,245955,458397,948201,1857965,3160371,4153971,2217787,3402761,5855953,9067535,11402651,9170285
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3807508,7710844,17354771,37983463,...
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|