|
| |
|
|
A221308
|
|
T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, vertical or antidiagonal neighbor, with every occupancy equal to zero or two
|
|
5
|
|
|
|
0, 0, 0, 0, 5, 0, 1, 10, 10, 1, 0, 31, 0, 31, 0, 0, 90, 312, 312, 90, 0, 0, 259, 0, 3334, 0, 259, 0, 1, 746, 10042, 38146, 38146, 10042, 746, 1, 0, 2150, 0, 431474, 0, 431474, 0, 2150, 0, 0, 6192, 319226, 4855258, 19642342, 19642342, 4855258, 319226, 6192, 0, 0, 17831, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,5
|
|
|
COMMENTS
|
Table starts
.0.....0......0........1........0.........0.......0..........1.........0
.0.....5.....10.......31.......90.......259.....746.......2150......6192
.0....10......0......312........0.....10042.......0.....319226.........0
.1....31....312.....3334....38146....431474.4855258...54587829.613235478
.0....90......0....38146........0..19642342.......0.9842336697
.0...259..10042...431474.19642342.880259428
.0...746......0..4855258........0
.1..2150.319226.54587829
.0..6192......0
.0.17831
.0
|
|
|
LINKS
|
R. H. Hardin, Table of n, a(n) for n = 1..71
|
|
|
EXAMPLE
|
Some solutions for n=3 k=4
..0..0..2..0....0..2..0..2....0..2..0..0....2..0..0..0....0..2..0..0
..2..2..2..0....2..2..0..2....0..2..2..2....2..2..2..0....2..2..2..2
..0..2..2..0....0..0..0..2....0..0..2..2....0..2..2..0....0..0..2..0
|
|
|
CROSSREFS
|
Sequence in context: A060524 A133843 A215083 * A241855 A221800 A291774
Adjacent sequences: A221305 A221306 A221307 * A221309 A221310 A221311
|
|
|
KEYWORD
|
nonn,tabl
|
|
|
AUTHOR
|
R. H. Hardin Jan 09 2013
|
|
|
STATUS
|
approved
|
| |
|
|
