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 A218902 #8 Jul 23 2025 00:09:12 %S A218902 64,244,4700,35812,463746,4575512,52413310,560696174,6215491022, %T A218902 67904677040,747179229166,8201691157406,90124453206806, %U A218902 990167833005856,10878984112533098,119537916859104756,1313402969442315846 %N A218902 Number of 6Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 6Xn array. %C A218902 Row 6 of A218897 %H A218902 R. H. Hardin, <a href="/A218902/b218902.txt">Table of n, a(n) for n = 1..55</a> %e A218902 Some solutions for n=3 %e A218902 ..0..0..1....1..0..0....1..0..1....1..0..1....1..0..1....0..0..0....1..1..1 %e A218902 ..0..0..1....0..0..1....0..0..1....1..0..0....1..0..0....0..0..0....1..0..1 %e A218902 ..1..0..1....1..0..1....1..0..1....0..0..0....0..0..0....0..0..0....0..0..0 %e A218902 ..1..1..1....0..0..1....1..1..1....0..0..0....0..0..1....0..0..0....0..0..1 %e A218902 ..1..1..1....0..0..0....0..0..0....0..1..0....1..0..0....0..0..0....0..0..1 %e A218902 ..1..1..1....1..0..0....0..0..0....0..0..0....1..0..0....0..0..0....0..0..1 %K A218902 nonn %O A218902 1,1 %A A218902 _R. H. Hardin_ Nov 08 2012