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 A220765 #6 Jul 23 2025 01:27:45 %S A220765 1024,5494,1094438,14683998,1383229596,30118695378,1934925188892, %T A220765 55544210268658,2886907348105332,96532019802189416, %U A220765 4470062232868197086,162590707759649145912,7069322362385242133824,269306206505914142709646 %N A220765 Number of 5Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..3 5Xn array. %C A220765 Row 5 of A220761 %H A220765 R. H. Hardin, <a href="/A220765/b220765.txt">Table of n, a(n) for n = 1..22</a> %e A220765 Some solutions for n=3 %e A220765 ..0..0..2....0..0..0....0..0..2....0..0..2....0..0..0....0..0..0....0..0..0 %e A220765 ..0..0..3....2..0..3....2..0..0....0..0..3....2..0..0....3..0..1....2..0..2 %e A220765 ..2..0..3....3..1..1....3..0..1....2..0..0....3..0..0....3..0..3....3..1..2 %e A220765 ..1..0..1....1..1..3....1..1..1....3..0..0....0..0..2....3..0..0....3..1..1 %e A220765 ..0..0..0....2..1..2....1..1..1....2..0..3....0..0..2....1..0..1....3..1..2 %K A220765 nonn %O A220765 1,1 %A A220765 _R. H. Hardin_ Dec 19 2012