login
Number of (n+1)X5 0..2 arrays with every 2X2 subblock having one, two or three distinct clockwise edge differences
1

%I #5 Mar 31 2012 12:37:33

%S 39909,6747079,1140445889,192819707871,32601836961677,

%T 5512336193872815,932029892451556289,157588340458153024619,

%U 26645160471633337792649,4505184709283969657378483,761740178435342249576666973

%N Number of (n+1)X5 0..2 arrays with every 2X2 subblock having one, two or three distinct clockwise edge differences

%C Column 4 of A210390

%H R. H. Hardin, <a href="/A210386/b210386.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 223*a(n-1) -9461*a(n-2) +38458*a(n-3) +3549663*a(n-4) -32588685*a(n-5) -508261230*a(n-6) +5706283402*a(n-7) +35105920095*a(n-8) -470735135093*a(n-9) -1154545872838*a(n-10) +21185965166884*a(n-11) +11225843446480*a(n-12) -544537281641561*a(n-13) +302744827612151*a(n-14) +8161346038514766*a(n-15) -9528641858555588*a(n-16) -73104114337370148*a(n-17) +109184395751663568*a(n-18) +406815111946067415*a(n-19) -670442664892782833*a(n-20) -1455165639539505801*a(n-21) +2462053942187126418*a(n-22) +3420041227155372378*a(n-23) -5685667280406325350*a(n-24) -5317279202551076247*a(n-25) +8464088502302311604*a(n-26) +5417981379313428776*a(n-27) -8206507857103512021*a(n-28) -3524350348222019545*a(n-29) +5179718539525222811*a(n-30) +1395392552338466122*a(n-31) -2099353043062207344*a(n-32) -304790403886902836*a(n-33) +529249988183090028*a(n-34) +26637678526607096*a(n-35) -78134322897382024*a(n-36) +1358756843570944*a(n-37) +6043523752505920*a(n-38) -329711911635072*a(n-39) -200633167870464*a(n-40) +9138104982528*a(n-41) +2395048366080*a(n-42)

%e Some solutions for n=4

%e ..2..1..0..2..2....0..0..1..1..0....0..2..1..2..2....2..1..2..1..0

%e ..0..0..0..1..0....0..1..0..2..2....2..2..1..1..1....1..2..1..2..1

%e ..1..2..0..2..0....2..1..1..2..0....1..0..0..0..0....1..1..1..0..0

%e ..2..2..2..0..2....1..1..2..1..0....1..1..1..0..2....2..1..2..1..2

%e ..2..0..1..0..0....1..1..2..2..2....1..2..1..1..1....2..1..2..1..1

%K nonn

%O 1,1

%A _R. H. Hardin_ Mar 20 2012