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 A265089 #6 Aug 12 2016 06:55:34 %S A265089 1,1,0,1,2,0,1,0,6,0,1,6,12,24,0,1,0,90,0,120,0,1,20,360,4464,1080, %T A265089 720,0,1,0,2040,0,493920,0,6300,0,1,70,10080,2850360,75502080, %U A265089 128269440,3135720,45360,0,1,0,54810,0,16074373800,0,57943903500,0,589680,0,1,252 %N A265089 T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with row sums equal and column sums equal. %C A265089 Table starts %C A265089 .1......1.......1...........1........1...........1.............1..........1 %C A265089 .0......2.......0...........6........0..........20.............0.........70 %C A265089 .0......6......12..........90......360........2040.........10080......54810 %C A265089 .0.....24.......0........4464........0.....2850360.............0.2645541360 %C A265089 .0....120....1080......493920.75502080.16074373800.3565914584400 %C A265089 .0....720.......0...128269440........0 %C A265089 .0...6300.3135720.57943903500 %C A265089 .0..45360.......0 %C A265089 .0.589680 %C A265089 .0 %H A265089 R. H. Hardin, <a href="/A265089/b265089.txt">Table of n, a(n) for n = 1..60</a> %e A265089 Some solutions for n=4 k=4 %e A265089 ..3..0..1..2....0..3..3..0....1..1..2..2....3..1..2..0....1..0..3..2 %e A265089 ..3..1..2..0....3..0..0..3....2..3..0..1....3..1..0..2....1..2..0..3 %e A265089 ..0..2..1..3....1..1..2..2....0..2..1..3....0..1..3..2....2..1..3..0 %e A265089 ..0..3..2..1....2..2..1..1....3..0..3..0....0..3..1..2....2..3..0..1 %Y A265089 Row 2 is A126869. %Y A265089 Row 3 is A002898. %K A265089 nonn,tabl %O A265089 1,5 %A A265089 _R. H. Hardin_, Dec 01 2015