login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

Number of nX5 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:17:37

%S 9,100,736,6307,53442,457738,3899732,33335734,284461696,2429715557,

%T 20742789506,177131531358,1512387248385,12914053828252,

%U 110266892304637,941535315103858,8039395936919182,68645593300515776,586139023034958513

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

%C Column 5 of A266101.

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

%F Empirical: a(n) = a(n-1) +74*a(n-2) +76*a(n-3) -1329*a(n-4) -1483*a(n-5) +10492*a(n-6) +9562*a(n-7) -37686*a(n-8) -32576*a(n-9) +49666*a(n-10) +84934*a(n-11) -16375*a(n-12) -90227*a(n-13) -34968*a(n-14) +34720*a(n-15) +23431*a(n-16) +2409*a(n-17) for n>20

%e Some solutions for n=4

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

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

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

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

%Y Cf. A266101.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 21 2015