|
%I #5 Mar 31 2012 12:37:30
%S 9348,759642,61289190,4953638163,400252237467,32342700329739,
%T 2613436161921981,211178329470822063,17064216751948148973,
%U 1378870531424172401901,111419341944536370111453
%N Half the number of (n+1)X5 0..2 arrays with every 2X2 subblock having exactly one duplicate clockwise edge difference
%C Column 4 of A209796
%H R. H. Hardin, <a href="/A209792/b209792.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 76*a(n-1) +900*a(n-2) -42410*a(n-3) +22649*a(n-4) +5503843*a(n-5) -33812631*a(n-6) -52852804*a(n-7) +896916910*a(n-8) -1240445413*a(n-9) -6887750040*a(n-10) +18088038881*a(n-11) +14908131615*a(n-12) -74462369219*a(n-13) +6262313511*a(n-14) +129707254006*a(n-15) -48725542109*a(n-16) -101163963885*a(n-17) +41149417610*a(n-18) +34422303955*a(n-19) -9155372128*a(n-20) -4187924158*a(n-21) +600253814*a(n-22) +126714760*a(n-23) -13520692*a(n-24) -134544*a(n-25)
%e Some solutions for n=4
%e ..2..2..2..1..1....1..2..0..0..1....2..1..0..2..1....1..2..2..1..2
%e ..0..2..0..0..1....0..2..0..1..1....2..2..2..2..0....2..2..0..0..2
%e ..0..1..0..1..1....0..1..0..0..2....1..1..0..0..0....1..1..0..2..2
%e ..1..1..2..1..2....1..1..2..0..0....0..0..0..1..0....2..2..2..2..0
%e ..0..0..0..0..2....1..2..2..2..1....0..1..2..1..1....1..1..1..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Mar 13 2012
| 