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 vertical neighbors differing from itself by exactly one.
1

%I #4 Dec 20 2015 17:29:06

%S 1,1,5,7,29,29,55,115,221,443,851,1659,3318,6531,12883,25491,50374,

%T 99493,196918,389027,770195,1523153,3012689,5958639,11790926,23319020,

%U 46141333,91261509,180569396,357189221,706693599,1397946605,2765830557,5471342440

%N Number of nX5 integer arrays with each element equal to the number of horizontal and vertical neighbors differing from itself by exactly one.

%C Column 5 of A266081.

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

%e Some solutions for n=4

%e ..2..3..2..0..0....0..0..0..0..0....0..0..0..0..0....0..2..3..2..0

%e ..3..4..3..0..0....0..0..0..0..0....0..2..3..2..0....0..3..4..3..0

%e ..2..3..2..0..0....0..0..0..0..0....0..3..4..3..0....0..2..3..2..0

%e ..0..0..0..0..0....0..0..0..0..0....0..2..3..2..0....0..0..0..0..0

%Y Cf. A266081.

%K nonn

%O 1,3

%A _R. H. Hardin_, Dec 20 2015