Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #4 Nov 11 2012 06:22:23
%S 25,993,32313,1030457,32958333,1054361217,33731920377,1079168990473,
%T 34525267140421,1104548251723921,35337216591063957,
%U 1130524520728419705,36168261542737956813,1157111693607114751041,37018850627063603301485
%N Hilltop maps: number of nX5 binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..2 nX5 array
%C Column 5 of A219063
%H R. H. Hardin, <a href="/A219060/b219060.txt">Table of n, a(n) for n = 1..210</a>
%F Empirical: a(n) = 28*a(n-1) +110*a(n-2) +489*a(n-3) +1905*a(n-4) +18806*a(n-5) +7104*a(n-6) +44931*a(n-7) +115437*a(n-8) +792664*a(n-9) -2178978*a(n-10) +305339*a(n-11) -3082246*a(n-12) -6015354*a(n-13) -1186694*a(n-14) +3976166*a(n-15) +2138389*a(n-16) +9437494*a(n-17) +10047612*a(n-18) +2259507*a(n-19) -5831699*a(n-20) -2301084*a(n-21) -5320482*a(n-22) -3891345*a(n-23) -1499484*a(n-24) +5947466*a(n-25) -809446*a(n-26) +270372*a(n-27) -1403453*a(n-28) +760522*a(n-29) -3320432*a(n-30) +505697*a(n-31) +381095*a(n-32) +489288*a(n-33) -67734*a(n-34) +857945*a(n-35) +213222*a(n-36) -211110*a(n-37) +2526*a(n-38) -111222*a(n-39) -102345*a(n-40) -28374*a(n-41) +30420*a(n-42) +2025*a(n-43) +22815*a(n-44) +3420*a(n-45) -5670*a(n-46) -675*a(n-47) -675*a(n-48) -1350*a(n-49) +675*a(n-51)
%e Some solutions for n=3
%e ..1..0..1..1..1....0..1..1..1..0....1..0..1..0..0....0..0..0..1..0
%e ..1..1..0..0..0....0..1..1..0..1....1..1..1..1..0....1..1..1..1..0
%e ..0..0..0..0..1....1..0..1..1..1....1..1..1..0..1....1..1..1..1..0
%K nonn
%O 1,1
%A _R. H. Hardin_ Nov 11 2012