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 A220761 #7 Apr 17 2022 22:27:54 %S A220761 4,4,16,16,28,64,36,268,192,256,94,708,4328,956,1024,236,4766,24934, %T A220761 68212,5494,4096,602,15724,354706,548130,1094438,30888,16384,1528, %U A220761 88434,2715804,21154028,14683998,17553448,172038,65536,3882,331024,31659166 %N A220761 T(n,k) = Number of n X k arrays of the minimum value of corresponding elements and their horizontal, diagonal or antidiagonal neighbors in a random 0..3 n X k array. %C A220761 Table starts %C A220761 .......4........4..........16...........36............94...........236 %C A220761 ......16.......28.........268..........708..........4766.........15724 %C A220761 ......64......192........4328........24934........354706.......2715804 %C A220761 .....256......956.......68212.......548130......21154028.....252705768 %C A220761 ....1024.....5494.....1094438.....14683998....1383229596...30118695378 %C A220761 ....4096....30888....17553448....380208068...89823059958.3442732323766 %C A220761 ...16384...172038...281649154...9770273902.5844655062086 %C A220761 ...65536...964828..4519836612.252723391836 %C A220761 ..262144..5400158.72535767418 %C A220761 .1048576.30225794 %C A220761 .4194304 %H A220761 R. H. Hardin, <a href="/A220761/b220761.txt">Table of n, a(n) for n = 1..71</a> %e A220761 Some solutions for n=3, k=4 %e A220761 ..0..0..0..0....1..1..1..1....0..0..1..1....1..2..0..1....0..0..0..0 %e A220761 ..0..1..0..0....3..0..2..1....2..0..1..1....1..1..0..0....0..2..0..0 %e A220761 ..2..1..0..0....0..0..2..3....1..1..3..2....1..2..0..3....2..3..0..0 %Y A220761 Column 1 is A000302. %Y A220761 Column 2 is A218175. %Y A220761 Row 1 is A218051. %K A220761 nonn,tabl %O A220761 1,1 %A A220761 _R. H. Hardin_, Dec 19 2012