login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of nX4 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors exactly one smaller than itself.
1

%I #4 Dec 21 2015 08:16:51

%S 5,36,161,929,4893,26948,145274,790986,4286644,23281595,126318252,

%T 685685972,3721248548,20197452145,109618496442,594950280201,

%U 3229037349370,17525382955525,95117628995827,516243924279843

%N Number of nX4 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors exactly one smaller than itself.

%C Column 4 of A266101.

%H R. H. Hardin, <a href="/A266097/b266097.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = a(n-1) +24*a(n-2) +17*a(n-3) -89*a(n-4) -40*a(n-5) +146*a(n-6) +18*a(n-7) -82*a(n-8) -6*a(n-9) -8*a(n-10) +36*a(n-11) -13*a(n-12) +a(n-13) -2*a(n-14) +a(n-15) for n>16

%e Some solutions for n=4

%e ..0..0..0..1....0..0..2..1....0..0..2..1....0..0..1..1....0..1..1..0

%e ..1..1..2..0....1..1..0..1....1..1..0..1....1..2..0..1....2..1..0..1

%e ..1..0..0..1....1..0..1..1....2..1..1..1....0..0..2..0....1..0..1..1

%e ..1..1..1..0....1..1..0..0....1..0..0..0....1..1..0..1....1..2..0..1

%Y Cf. A266101.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 21 2015