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 A218522 #6 Jul 22 2025 23:57:53 %S A218522 4,4,16,16,36,64,36,286,236,256,94,1348,4634,1528,1024,236,7902,46140, %T A218522 76214,9858,4096,602,42812,639228,1608968,1254462,63592,16384,1528, %U A218522 242438,7687526,49466988,55161270,20655650,410218,65536,3882,1349524 %N A218522 T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..3 nXk array. %C A218522 Table starts %C A218522 .....4.......4.........16............36...............94.................236 %C A218522 ....16......36........286..........1348.............7902...............42812 %C A218522 ....64.....236.......4634.........46140...........639228.............7687526 %C A218522 ...256....1528......76214.......1608968.........49466988..........1326731972 %C A218522 ..1024....9858....1254462......55161270.......3856183182........232640291710 %C A218522 ..4096...63592...20655650....1884162624.....300890728324......40522780697742 %C A218522 .16384..410218..340133516...64278999490...23498366579584....7051080210074740 %C A218522 .65536.2646208.5601018048.2192134613268.1835588124922808.1226141540661411646 %H A218522 R. H. Hardin, <a href="/A218522/b218522.txt">Table of n, a(n) for n = 1..96</a> %e A218522 Some solutions for n=3 k=4 %e A218522 ..3..1..0..0....3..1..1..0....2..2..2..2....2..1..1..1....0..0..0..0 %e A218522 ..2..1..0..3....2..0..0..0....3..3..2..0....3..1..1..1....2..0..1..2 %e A218522 ..2..3..0..0....0..0..0..2....3..0..0..0....2..1..2..2....0..0..1..3 %Y A218522 Row 1 is A218051 %K A218522 nonn,tabl %O A218522 1,1 %A A218522 _R. H. Hardin_ Oct 31 2012