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 A265373 #6 Aug 12 2016 06:55:34 %S A265373 1,0,1,0,0,1,0,0,1,1,0,0,1,10,1,0,0,1,32,99,1,0,0,1,236,4954,1146,1,0, %T A265373 0,1,1238,363850,878953,15422,1,0,0,1,7968,25964546,860077644, %U A265373 192333677,237135,1,0,0,1,49214,2006263350,919241950442,3040856393843,53404173562 %N A265373 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal, vertical or antidiagonal neighbors and new values introduced sequentially from 0. %C A265373 Table starts %C A265373 .1.......0...........0.............0............0..........0............0 %C A265373 .1.......0...........0.............0............0..........0............0 %C A265373 .1.......1...........1.............1............1..........1............1 %C A265373 .1......10..........32...........236.........1238.......7968........49214 %C A265373 .1......99........4954........363850.....25964546.2006263350.159927435847 %C A265373 .1....1146......878953.....860077644.919241950442 %C A265373 .1...15422...192333677.3040856393843 %C A265373 .1..237135.53404173562 %C A265373 .1.4106680 %C A265373 .1 %H A265373 R. H. Hardin, <a href="/A265373/b265373.txt">Table of n, a(n) for n = 1..60</a> %e A265373 Some solutions for n=4 k=4 %e A265373 ..0..1..2..0....0..1..2..3....0..1..2..0....0..1..2..3....0..1..2..1 %e A265373 ..2..3..1..3....3..0..1..2....3..0..3..2....2..3..0..2....2..0..3..2 %e A265373 ..0..2..0..2....1..3..0..1....1..2..1..3....1..2..1..0....3..1..0..3 %e A265373 ..1..3..1..3....0..2..3..2....3..0..2..1....3..0..3..1....0..3..1..2 %Y A265373 Column 2 is A190823. %K A265373 nonn,tabl %O A265373 1,14 %A A265373 _R. H. Hardin_, Dec 07 2015