|
%I #5 Mar 31 2012 12:37:04
%S 166,1001,6086,36522,219755,1323027,7962992,47928592,288482790,
%T 1736374118,10451212777,62905729186,378628840855,2278962509607,
%U 13717048411662,82562752244975,496944229784914,2991101444785801
%N Number of (n+2)X3 0..1 arrays with every 3X3 subblock having three equal elements in a row horizontally, vertically, diagonally or antidiagonally at least two different ways, and new values 0..1 introduced in row major order
%C Column 1 of A204971
%H R. H. Hardin, <a href="/A204964/b204964.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 6*a(n-1) +6*a(n-3) -28*a(n-4) -25*a(n-5) +4*a(n-6) +2*a(n-7) +85*a(n-8) -46*a(n-9) +68*a(n-10) +46*a(n-11) -20*a(n-12) +12*a(n-13) -48*a(n-14) +16*a(n-15)
%e Some solutions for n=3
%e ..0..0..1....0..1..0....0..0..0....0..0..1....0..0..0....0..0..0....0..1..0
%e ..0..1..1....1..0..0....1..1..1....0..0..0....1..0..0....0..0..1....0..1..1
%e ..1..1..1....1..0..0....1..1..1....1..1..0....0..1..1....1..0..1....0..1..1
%e ..1..1..1....1..1..1....0..0..0....0..0..0....1..1..1....0..0..1....0..1..1
%e ..1..1..1....1..0..1....0..1..1....0..0..0....0..0..1....1..1..1....0..1..1
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 21 2012
| 