Triangle T(n,k), n>=1, 2<=k<=n+1, read by rows, where T(n,k) is the number of self-avoiding square-lattice polygons by area n and perimeter 2*k.
A259857
Triangle T(n,k), n>=1, 2<=k<=n+1, read by rows, where T(n,k) is the number of self-avoiding square-lattice polygons by area n and perimeter 2*k.
Terms
- a(0) =1a(1) =0a(2) =2a(3) =0a(4) =0a(5) =6a(6) =0a(7) =0a(8) =1a(9) =18a(10) =0a(11) =0a(12) =0a(13) =8a(14) =55a(15) =0a(16) =0a(17) =0a(18) =2a(19) =40a(20) =174a(21) =0a(22) =0a(23) =0a(24) =0a(25) =22a(26) =168a(27) =566a(28) =0a(29) =0
External references
- oeis: A259857