cp's OEIS Frontend

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.

%I A221507 #6 Jul 23 2025 02:00:46
%S A221507 0,1,0,0,9,0,1,44,64,0,0,446,664,441,0,1,3334,31663,12495,3025,0,0,
%T A221507 27540,730874,2691211,221614,20736,0,1,219070,22664752,223123842,
%U A221507 219689604,4010052,142129,0,0,1766136,617892584,26917553016,61691224718
%N 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.
%C A221507 Table starts
%C A221507 .0......1........0...........1...........0...........1.........0...........1
%C A221507 .0......9.......44.........446........3334.......27540....219070.....1766136
%C A221507 .0.....64......664.......31663......730874....22664752.617892584.17782943460
%C A221507 .0....441....12495.....2691211...223123842.26917553016
%C A221507 .0...3025...221614...219689604.61691224718
%C A221507 .0..20736..4010052.18054912942
%C A221507 .0.142129.72195950
%C A221507 .0.974169
%C A221507 .0
%H A221507 R. H. Hardin, <a href="/A221507/b221507.txt">Table of n, a(n) for n = 1..48</a>
%e A221507 Some solutions for n=3 k=4
%e A221507 ..1..1..3..0....0..0..0..0....0..0..1..1....1..0..1..0....1..0..1..1
%e A221507 ..1..1..1..1....1..3..2..2....0..4..1..0....1..2..0..3....0..3..0..1
%e A221507 ..0..3..0..0....2..1..1..0....2..0..2..1....1..1..2..0....2..0..2..1
%Y A221507 Column 2 is A049684
%K A221507 nonn,tabl
%O A221507 1,5
%A A221507 _R. H. Hardin_ Jan 18 2013