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”).
%I #4 Dec 09 2015 10:00:44
%S 1864,502154,161435322,52509347006,16879041018070,5327856426356284,
%T 1653688201339124766,505814947757578021828,152811753980421954365094,
%U 45684812294133949143632978,13536944058009909827807440148
%N Number of nX6 0..n+6-2 arrays with each element differing from its horizontal and vertical neighbors by one or two.
%C Column 6 of A265458.
%H R. H. Hardin, <a href="/A265456/b265456.txt">Table of n, a(n) for n = 1..65</a>
%e Some solutions for n=1
%e ..2..3..2..1..3..5....4..2..3..2..1..3....1..2..0..1..3..1....4..3..4..2..4..2
%Y Cf. A265458.
%K nonn
%O 1,1
%A _R. H. Hardin_, Dec 09 2015