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 A217642 #6 Jul 22 2025 23:42:21 %S A217642 37,293,5119,80653,1348399,22516459,374406369,6249355897,104219396757, %T A217642 1738366122579,28998563675605,483717812615381,8068980243223419, %U A217642 134599543257146021,2245271881774026885,37453685830252207957 %N A217642 Number of nX5 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random 0..2 nX5 array. %C A217642 Column 5 of A217645 %H A217642 R. H. Hardin, <a href="/A217642/b217642.txt">Table of n, a(n) for n = 1..21</a> %e A217642 Some solutions for n=3 %e A217642 ..2..1..0..0..1....2..2..0..0..2....2..2..2..1..1....1..1..0..0..0 %e A217642 ..1..0..0..0..1....1..0..0..0..2....2..2..1..1..1....1..1..0..0..0 %e A217642 ..0..0..0..0..1....0..0..0..0..2....2..2..1..1..1....2..2..2..2..2 %K A217642 nonn %O A217642 1,1 %A A217642 _R. H. Hardin_ Oct 09 2012