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 A218901 #8 Jul 23 2025 00:09:05 %S A218901 32,98,1162,6422,54726,373612,2880294,20982806,157437728,1166572286, %T A218901 8697719814,64700267892,481788660634,3586697140250,26703604337056, %U A218901 198819608617794,1480252390312110,11021165108877556,82055993062915878 %N A218901 Number of 5Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..1 5Xn array. %C A218901 Row 5 of A218897 %H A218901 R. H. Hardin, <a href="/A218901/b218901.txt">Table of n, a(n) for n = 1..53</a> %e A218901 Some solutions for n=3 %e A218901 ..0..0..1....0..0..0....0..0..0....0..0..1....0..0..0....1..0..0....0..0..0 %e A218901 ..0..0..0....1..0..1....1..0..0....1..0..0....0..1..0....1..0..1....0..0..1 %e A218901 ..1..0..1....1..0..1....1..0..1....0..0..0....1..1..1....1..0..1....0..0..1 %e A218901 ..0..0..0....0..0..1....1..0..1....1..0..0....0..1..0....0..0..1....1..0..0 %e A218901 ..1..0..1....1..0..0....1..0..0....0..0..1....0..0..0....0..0..1....1..0..0 %K A218901 nonn %O A218901 1,1 %A A218901 _R. H. Hardin_ Nov 08 2012