|
%I #7 Oct 06 2015 21:44:07
%S 131528,17903016,2473041560,343092183768,47661128330328,
%T 6623652903138136,920635760474340792,127966524262127129240,
%U 17787331338639722204888,2472447761007115783120024,343671940357621953613048984
%N Number of (n+1) X 5 0..3 arrays with the number of clockwise edge increases in every 2 X 2 subblock equal to the number of counterclockwise edge increases.
%C Column 4 of A208492.
%H R. H. Hardin, <a href="/A208488/b208488.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 331*a(n-1) -42473*a(n-2) +2921758*a(n-3) -121613667*a(n-4) +3193837784*a(n-5) -51309310271*a(n-6) +392270114821*a(n-7) +2097897058257*a(n-8) -88066401334125*a(n-9) +944760671703609*a(n-10) -3388478858349371*a(n-11) -28138776677261920*a(n-12) +406910268324391522*a(n-13) -1800952491692518254*a(n-14) -2005215280734326556*a(n-15) +60609578171667887119*a(n-16) -270028454957006504815*a(n-17) +182355190165331176435*a(n-18) +3060413484257090474178*a(n-19) -13351303973433069751367*a(n-20) +16387608270157050621028*a(n-21) +46854135453066296272317*a(n-22) -210672221663756346464773*a(n-23) +269397311610959406719189*a(n-24) +168189389486844585680137*a(n-25) -904866121673799723962671*a(n-26) +785406154635688408613539*a(n-27) +616293478754740710332742*a(n-28) -1519246139015617112434854*a(n-29) +442063068414927085398556*a(n-30) +982679443398074289762404*a(n-31) -745965997740338203300080*a(n-32) -219077387868878750301552*a(n-33) +355427259973886129188512*a(n-34) -15134241343854924241936*a(n-35) -72930257102218873038048*a(n-36) +10410389217495148082304*a(n-37) +6031969263432126323456*a(n-38) -809281239929331207680*a(n-39) -128891115849056067584*a(n-40) +14859371129714278400*a(n-41)
%e Some solutions for n=4:
%e ..1..1..3..2..0....0..1..3..3..3....0..0..1..3..0....1..2..1..1..0
%e ..3..3..0..3..1....2..3..0..3..0....2..0..0..1..2....0..1..0..0..2
%e ..2..2..3..2..3....2..2..3..2..3....0..3..3..0..1....1..1..0..0..0
%e ..1..1..2..0..1....0..0..1..3..2....0..3..0..1..0....1..3..1..1..0
%e ..0..0..1..2..3....0..2..3..2..3....3..2..3..0..2....1..3..3..3..1
%K nonn
%O 1,1
%A _R. H. Hardin_, Feb 27 2012
| 