login
A221275
T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, diagonal or antidiagonal neighbor, with every occupancy equal to zero or two
5
0, 0, 0, 0, 4, 0, 1, 4, 0, 0, 0, 25, 0, 16, 0, 0, 52, 100, 16, 0, 0, 0, 196, 0, 1089, 0, 64, 0, 1, 520, 0, 4920, 6724, 64, 0, 0, 0, 1681, 0, 94864, 0, 56644, 0, 256, 0, 0, 4840, 46656, 707600, 0, 626424, 400689, 256, 0, 0, 0, 14884, 0, 9517225, 0, 62220544, 0, 3122289, 0
OFFSET
1,5
COMMENTS
Table starts
.0....0...0.......1......0........0......0.........1........0.....0.....0.1
.0....4...4......25.....52......196....520......1681.....4840.14884.44044
.0....0...0.....100......0........0......0.....46656........0.....0
.0...16..16....1089...4920....94864.707600...9517225.87086136
.0....0...0....6724......0........0......0.644652100
.0...64..64...56644.626424.62220544
.0....0...0..400689......0
.0..256.256.3122289
.0....0...0
.0.1024
.0
Even columns are perfect squares
LINKS
EXAMPLE
Some solutions for n=4 k=4
..0..0..0..2....0..0..0..0....0..0..0..2....2..2..2..0....0..0..2..0
..2..2..2..0....2..2..2..2....2..2..2..0....0..2..0..2....2..2..2..2
..2..2..0..0....0..0..0..2....0..2..2..2....2..2..2..0....0..0..0..2
..0..2..2..0....2..2..2..0....2..0..0..0....0..0..0..0....0..2..2..0
CROSSREFS
Sequence in context: A127538 A096008 A122873 * A176803 A115636 A115715
KEYWORD
nonn,tabl
AUTHOR
R. H. Hardin Jan 09 2013
STATUS
approved