|
|
A221419
|
|
T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal or antidiagonal neighbor, with every occupancy equal to zero or two
|
|
11
|
|
|
0, 2, 0, 0, 4, 0, 4, 10, 8, 0, 0, 29, 0, 16, 0, 8, 84, 226, 150, 32, 0, 0, 242, 0, 1766, 0, 64, 0, 16, 696, 6798, 17792, 13794, 2250, 128, 0, 0, 2000, 0, 193809, 0, 107695, 0, 256, 0, 32, 5744, 198823, 2026142, 5501288, 3813004, 840673, 33750, 512, 0, 0, 16492, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Table starts
.0....2......0.........4.........0............8..........0...........16
.0....4.....10........29........84..........242........696.........2000
.0....8......0.......226.........0.........6798..........0.......198823
.0...16....150......1766.....17792.......193809....2026142.....21225843
.0...32......0.....13794.........0......5501288..........0...2238166260
.0...64...2250....107695...3813004....156275181.6079373768.237226735061
.0..128......0....840673.........0...4438212854..........0
.0..256..33750...6561928.817415641.126047555332
.0..512......0..51218473.........0
.0.1024.506250.399777826
.0.2048......0
.0.4096
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3 k=4
..2..0..0..2....0..2..2..0....0..2..0..0....0..2..0..0....2..2..0..0
..0..2..0..0....0..2..0..2....2..2..2..2....0..2..2..0....0..0..2..2
..0..2..2..2....0..2..2..0....0..0..0..2....2..2..2..0....2..0..2..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|