A183450 T(n,k)=Number of nXk binary arrays with every 1 having exactly two king-move neighbors equal to 1.
1, 1, 1, 1, 5, 1, 1, 9, 9, 1, 1, 13, 18, 13, 1, 1, 33, 30, 30, 33, 1, 1, 69, 107, 72, 107, 69, 1, 1, 121, 265, 283, 283, 265, 121, 1, 1, 253, 553, 831, 2054, 831, 553, 253, 1, 1, 529, 1505, 2399, 9208, 9208, 2399, 1505, 529, 1, 1, 1013, 3852, 7761, 34867, 53608, 34867, 7761
Offset: 1
Examples
Some solutions for 6X5 ..0..1..0..0..0....1..1..0..1..1....1..1..0..0..1....0..0..0..1..1 ..1..0..1..0..0....0..1..0..1..0....1..0..0..1..1....0..0..0..1..0 ..1..0..1..0..0....0..0..0..0..0....0..0..0..0..0....0..1..0..0..0 ..1..0..0..1..0....0..0..1..1..0....0..0..0..1..1....1..0..1..0..0 ..0..1..0..1..0....0..1..0..0..1....1..1..0..0..1....1..0..1..0..0 ..0..0..1..0..0....0..0..1..1..0....1..0..0..0..0....0..1..0..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..363
Crossrefs
Column 2 is A089977(n+1)
Comments