A221507 T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal, diagonal or antidiagonal neighbor, without consecutive moves in the same direction.
0, 1, 0, 0, 9, 0, 1, 44, 64, 0, 0, 446, 664, 441, 0, 1, 3334, 31663, 12495, 3025, 0, 0, 27540, 730874, 2691211, 221614, 20736, 0, 1, 219070, 22664752, 223123842, 219689604, 4010052, 142129, 0, 0, 1766136, 617892584, 26917553016, 61691224718
Offset: 1
Examples
Some solutions for n=3 k=4 ..1..1..3..0....0..0..0..0....0..0..1..1....1..0..1..0....1..0..1..1 ..1..1..1..1....1..3..2..2....0..4..1..0....1..2..0..3....0..3..0..1 ..0..3..0..0....2..1..1..0....2..0..2..1....1..1..2..0....2..0..2..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..48
Crossrefs
Column 2 is A049684
Comments