cp's OEIS Frontend

A202883 Number of n X 2 0..2 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor.

%I A202883 #11 Jun 02 2018 10:35:06
%S A202883 3,35,265,1849,13345,96941,701275,5071167,36689027,265439091,
%T A202883 1920308033,13892446697,100505282121,727107537885,5260271847715,
%U A202883 38055531396239,275313438949691,1991760080088995,14409424470217081,104245243244589977
%N A202883 Number of n X 2 0..2 arrays with every nonzero element less than or equal to some horizontal or vertical neighbor.
%C A202883 Column 2 of A202889.
%H A202883 R. H. Hardin, <a href="/A202883/b202883.txt">Table of n, a(n) for n = 1..210</a>
%F A202883 Empirical: a(n) = 6*a(n-1) +2*a(n-2) +46*a(n-3) +25*a(n-4) +36*a(n-5).
%F A202883 Empirical g.f.: (3 + 17*x + 49*x^2 + 51*x^3 + 36*x^4) / (1 - 6*x - 2*x^2 - 46*x^3 - 25*x^4 - 36*x^5). - _Colin Barker_, Jun 02 2018
%e A202883 Some solutions for n=5:
%e A202883   2 0   2 1   2 0   0 0   0 0   0 1   2 2   2 1   1 2   2 2
%e A202883   2 0   2 1   2 2   1 1   0 2   2 2   2 1   2 2   1 2   1 1
%e A202883   0 2   2 1   2 2   1 0   0 2   0 1   0 0   2 0   1 2   2 1
%e A202883   0 2   2 0   0 0   2 1   2 2   1 1   2 0   0 1   2 2   2 0
%e A202883   0 1   1 0   1 1   2 1   2 1   2 2   2 1   1 1   0 1   1 0
%Y A202883 Cf. A202889.
%K A202883 nonn
%O A202883 1,1
%A A202883 _R. H. Hardin_, Dec 25 2011