|
%I #5 Mar 31 2012 12:37:02
%S 11448,1075080,112592256,12184154082,1331721926667,146012317377342,
%T 16024704563231697,1759237470505955994,193152837690597697122,
%U 21207576736241661449097,2328548082128091084529791
%N Number of (n+1)X6 0..3 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements, and new values 0..3 introduced in row major order
%C Column 5 of A204572
%H R. H. Hardin, <a href="/A204569/b204569.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 179*a(n-1) -8908*a(n-2) +137964*a(n-3) +1149807*a(n-4) -62747265*a(n-5) +808434446*a(n-6) -4484318662*a(n-7) +3275499119*a(n-8) +100375182249*a(n-9) -615570345873*a(n-10) +1689825045573*a(n-11) -2021674602024*a(n-12) -928315208142*a(n-13) +6467936966622*a(n-14) -8574644356956*a(n-15) +3987231788124*a(n-16) +1799176026996*a(n-17) -3081486709152*a(n-18) +1405762064496*a(n-19) -228153998592*a(n-20)
%e Some solutions for n=4
%e ..0..0..0..0..1..1....0..1..1..0..2..3....0..1..1..2..2..3....0..1..1..0..2..1
%e ..2..0..2..0..0..1....2..0..1..1..0..2....0..0..1..1..2..2....1..1..0..3..0..2
%e ..3..2..2..2..0..0....0..1..2..1..1..0....3..0..0..1..1..2....3..1..1..0..1..0
%e ..3..3..2..2..2..0....2..0..1..1..0..2....0..1..0..0..1..1....2..3..1..1..2..1
%e ..3..1..3..2..3..2....1..2..0..1..1..0....1..2..1..0..0..1....1..2..3..1..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Jan 16 2012
| 