|
|
A220247
|
|
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..1 nXk array
|
|
5
|
|
|
1, 1, 1, 2, 5, 2, 4, 18, 18, 4, 7, 37, 143, 37, 7, 12, 85, 816, 816, 85, 12, 21, 184, 4467, 7140, 4467, 184, 21, 37, 393, 27192, 64258, 64258, 27192, 393, 37, 65, 826, 158296, 660677, 942945, 660677, 158296, 826, 65, 114, 1726, 915920, 6228324, 16925474
(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......18.......37........85.......184.......393......826......1726
...2...18.....143......816......4467.....27192....158296...915920...5443662
...4...37.....816.....7140.....64258....660677...6228324.59704733.580593280
...7...85....4467....64258....942945..16925474.267978208
..12..184...27192...660677..16925474.535851061
..21..393..158296..6228324.267978208
..37..826..915920.59704733
..65.1726.5443662
.114.3568
.200
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3 k=4
..1..1..0..0....0..0..1..0....0..1..0..0....1..0..1..0....0..0..1..1
..1..0..0..0....0..0..1..0....0..0..1..1....0..1..0..0....0..0..0..0
..1..0..1..0....0..0..0..1....0..0..0..0....0..1..0..0....0..1..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|