cp's OEIS Frontend

A266096 Number of n X 3 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors exactly one smaller than itself.

%I A266096 #8 Jan 09 2019 12:22:12
%S A266096 4,13,64,230,1012,3928,16428,65736,269908,1091720,4454304,18082796,
%T A266096 73622676,299247292,1217498296,4950677020,20137255328,81894658192,
%U A266096 333086633092,1354665687204,5509630157292,22408041160240,91136102570276
%N A266096 Number of n X 3 integer arrays with each element equal to the number of horizontal and antidiagonal neighbors exactly one smaller than itself.
%H A266096 R. H. Hardin, <a href="/A266096/b266096.txt">Table of n, a(n) for n = 1..210</a>
%F A266096 Empirical: a(n) = a(n-1) + 12*a(n-2) + 5*a(n-3) - 12*a(n-4) - 2*a(n-5).
%F A266096 Empirical g.f.: x*(4 + 9*x + 3*x^2 - 10*x^3 - 3*x^4) / (1 - x - 12*x^2 - 5*x^3 + 12*x^4 + 2*x^5). - _Colin Barker_, Jan 09 2019
%e A266096 Some solutions for n=4:
%e A266096 ..0..0..1....0..0..0....0..0..0....1..0..0....1..0..0....0..0..0....1..0..0
%e A266096 ..1..1..2....1..2..0....1..2..1....0..2..1....1..1..1....0..2..1....0..0..0
%e A266096 ..0..1..1....1..0..0....0..0..0....1..0..1....1..0..0....1..0..0....1..2..1
%e A266096 ..1..0..0....0..0..1....0..0..0....1..1..0....0..0..0....0..0..1....0..0..1
%Y A266096 Column 3 of A266101.
%K A266096 nonn
%O A266096 1,1
%A A266096 _R. H. Hardin_, Dec 21 2015