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 A218067 #8 Jul 22 2025 23:47:48 %S A218067 16,42,308,1664,10246,60804,368220,2217012,13380802,80716652, %T A218067 487004728,2938281242,17727888682,106960361186,645338542928, %U A218067 3893618011484,23491925716860,141737303076720,855164357481732,5159588643396442 %N A218067 Number of 4Xn arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..1 4Xn array. %C A218067 Row 4 of A218064 %H A218067 R. H. Hardin, <a href="/A218067/b218067.txt">Table of n, a(n) for n = 1..70</a> %e A218067 Some solutions for n=3 %e A218067 ..1..0..0....1..0..0....1..0..1....0..0..0....0..0..1....1..0..1....0..0..1 %e A218067 ..0..0..0....1..0..0....0..0..0....1..0..0....0..0..1....0..0..0....0..0..0 %e A218067 ..0..1..0....0..0..1....1..0..0....1..0..1....1..0..1....1..0..0....0..0..0 %e A218067 ..0..0..0....1..1..1....0..0..1....1..1..1....0..0..1....1..0..1....0..0..1 %K A218067 nonn %O A218067 1,1 %A A218067 _R. H. Hardin_ Oct 19 2012