%I #4 Oct 24 2012 08:28:21

%S 29,1017,32753,1048545,33552513,1073678481,34357707105,1099446617025,

%T 35182291517157,1125833320760065,36026666013866385,

%U 1152853304425906241,36891305485062692561,1180521767311893767793,37776696291257030450753

%N Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any king-move neighbor in a random 0..3 nX5 array

%C Column 5 of A218242

%H R. H. Hardin, <a href="/A218239/b218239.txt">Table of n, a(n) for n = 1..73</a>

%F Empirical: a(n) = 30*a(n-1) +60*a(n-2) +120*a(n-3) +239*a(n-4) +506*a(n-5) +1124*a(n-6) +2696*a(n-7) -207*a(n-8) -412*a(n-9) -644*a(n-10) -207*a(n-12) -764*a(n-13) -1692*a(n-14) +117*a(n-16) +262*a(n-17) +117*a(n-20) +378*a(n-21) -29*a(n-24) -29*a(n-28)

%e Some solutions for n=3

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

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

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

%K nonn

%O 1,1

%A _R. H. Hardin_ Oct 24 2012