|
|
A220342
|
|
T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their king-move neighbors in a random 0..3 nXk array
|
|
3
|
|
|
1, 1, 1, 2, 5, 2, 4, 24, 24, 4, 7, 89, 355, 89, 7, 12, 389, 3281, 3281, 389, 12, 21, 1570, 28993, 60003, 28993, 1570, 21, 37, 6413, 242224, 1022813, 1022813, 242224, 6413, 37, 65, 25744, 1973258, 16673578
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Table starts
..1....1......2.......4.......7.......12......21....37.65
..1....5.....24......89.....389.....1570....6413.25744
..2...24....355....3281...28993...242224.1973258
..4...89...3281...60003.1022813.16673578
..7..389..28993.1022813
.12.1570.242224
.21.6413
.37
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3 k=4
..0..1..1..0....0..0..0..0....0..0..1..1....0..0..0..1....1..1..1..0
..0..1..1..0....0..0..1..0....1..0..1..1....1..1..0..0....0..0..0..0
..0..1..1..1....0..0..1..1....1..1..1..1....1..1..0..1....1..1..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|