cp's OEIS Frontend

A206615 Number of (n+1)X3 0..2 arrays with every 2X3 or 3X2 subblock having no more than two equal edges, and new values 0..2 introduced in row major order.

%I A206615 #7 Jul 22 2025 19:32:53
%S A206615 86,1155,17708,270869,4099700,62250328,945314307,14350695690,
%T A206615 217872572862,3307774471061,50218674117508,762421824428498,
%U A206615 11575121642488239,175733960717293322,2668000123752680318
%N A206615 Number of (n+1)X3 0..2 arrays with every 2X3 or 3X2 subblock having no more than two equal edges, and new values 0..2 introduced in row major order.
%C A206615 Column 2 of A206621
%H A206615 R. H. Hardin, <a href="/A206615/b206615.txt">Table of n, a(n) for n = 1..210</a>
%F A206615 Empirical: a(n) = 14*a(n-1) +9*a(n-2) +199*a(n-3) -961*a(n-4) +12*a(n-5) -65*a(n-6) +4451*a(n-7) -2813*a(n-8) +623*a(n-9) -1152*a(n-10) +1104*a(n-11) -1036*a(n-12) +248*a(n-13) -408*a(n-14) +280*a(n-15)
%e A206615 Some solutions for n=4
%e A206615 ..0..0..1....0..0..0....0..0..1....0..0..0....0..0..0....0..1..0....0..0..0
%e A206615 ..2..1..2....1..2..1....2..0..1....1..0..1....1..2..1....2..1..2....1..0..1
%e A206615 ..0..1..2....1..0..2....0..1..2....2..1..0....0..2..0....2..0..1....0..2..0
%e A206615 ..1..2..0....0..1..0....1..1..2....0..1..1....0..1..2....0..1..1....0..0..2
%e A206615 ..0..1..0....2..0..2....0..0..1....2..0..1....1..0..1....0..1..0....0..1..0
%K A206615 nonn
%O A206615 1,1
%A A206615 _R. H. Hardin_ Feb 10 2012