This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A219083 #6 Jul 23 2025 00:13:27 %S A219083 1,2007,137251,6879341,407374825,24734141495,1473655240387, %T A219083 87658679181837,5224891480887673,311448275014507959, %U A219083 18561000349587530731,1106162872162349349293,65924427026919551179361 %N A219083 Hilltop maps: number of 6Xn binary arrays indicating the locations of corresponding elements not exceeded by any horizontal, diagonal or antidiagonal neighbor in a random 0..1 6Xn array. %C A219083 Row 6 of A219078 %H A219083 R. H. Hardin, <a href="/A219083/b219083.txt">Table of n, a(n) for n = 1..23</a> %e A219083 Some solutions for n=3 %e A219083 ..0..1..0....0..1..0....0..1..1....1..0..1....0..1..0....1..0..1....0..1..1 %e A219083 ..1..1..1....0..0..1....0..1..0....0..1..0....0..1..1....1..1..1....0..0..0 %e A219083 ..0..0..1....1..0..0....0..1..1....0..1..0....1..1..0....1..1..0....0..1..1 %e A219083 ..0..0..0....0..1..0....1..0..1....0..1..0....0..0..1....0..1..1....1..1..1 %e A219083 ..1..1..1....0..0..1....0..1..1....1..1..0....1..0..0....0..1..1....0..1..0 %e A219083 ..0..1..1....0..1..0....1..0..0....1..1..1....0..1..1....1..0..1....1..0..0 %K A219083 nonn %O A219083 1,2 %A A219083 _R. H. Hardin_ Nov 11 2012