Triangle read by rows: n-th row gives the number of pieces of size 1 X k required to build all free n-ominoes simultaneously, 1 <= k <= n. Long pieces are preferred over short ones.
A364038
Triangle read by rows: n-th row gives the number of pieces of size 1 X k required to build all free n-ominoes simultaneously, 1 <= k <= n. Long pieces are preferred over short ones.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =1a(4) =1a(5) =1a(6) =2a(7) =4a(8) =2a(9) =1a(10) =11a(11) =6a(12) =8a(13) =2a(14) =1a(15) =35a(16) =21a(17) =20a(18) =13a(19) =3a(20) =1a(21) =118a(22) =83a(23) =60a(24) =43a(25) =19a(26) =3a(27) =1a(28) =461a(29) =312
External references
- oeis: A364038