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 A220763 #6 Jul 23 2025 01:27:32 %S A220763 64,192,4328,24934,354706,2715804,31659166,277952034,2954256382, %T A220763 27594850862,281218334508,2702246506854,27016733242156, %U A220763 262977482298808,2606430063309362,25520149513177148,251935677082462500 %N A220763 Number of 3Xn arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..3 3Xn array. %C A220763 Row 3 of A220761 %H A220763 R. H. Hardin, <a href="/A220763/b220763.txt">Table of n, a(n) for n = 1..65</a> %e A220763 Some solutions for n=3 %e A220763 ..3..0..2....2..0..1....1..1..1....0..0..2....1..1..2....1..1..1....1..1..3 %e A220763 ..2..0..0....2..0..0....2..0..3....1..0..3....2..0..1....3..1..1....1..1..3 %e A220763 ..2..0..1....3..0..3....0..0..1....0..0..2....3..0..0....1..1..2....1..1..2 %K A220763 nonn %O A220763 1,1 %A A220763 _R. H. Hardin_ Dec 19 2012