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 A203564 #9 Apr 25 2024 13:26:01 %S A203564 3,3,3,3,9,3,3,9,9,3,3,33,87,33,3,3,53,177,177,53,3,3,183,993,5673, %T A203564 993,183,3,3,395,10833,32613,32613,10833,395,3,3,1249,35619,513903, %U A203564 2577513,513903,35619,1249,3,3,3141,219873,7343451,39612503,39612503,7343451 %N A203564 T(n,k) = Number of n X k 0..2 arrays with row sums equal and column sums equal. %C A203564 Table starts: %C A203564 .3....3.......3..........3...........3............3............3..............3 %C A203564 .3....9.......9.........33..........53..........183..........395...........1249 %C A203564 .3....9......87........177.........993........10833........35619.........219873 %C A203564 .3...33.....177.......5673.......32613.......513903......7343451......185804265 %C A203564 .3...53.....993......32613.....2577513.....39612503...1509893003....59794281893 %C A203564 .3..183...10833.....513903....39612503...8459809773.360255871643.37057831534783 %C A203564 .3..395...35619....7343451..1509893003.360255871643 %C A203564 .3.1249..219873..185804265.59794281893 %C A203564 .3.3141.2083713.1849858773 %C A203564 .3.9459.8710539 %H A203564 R. H. Hardin, <a href="/A203564/b203564.txt">Table of n, a(n) for n = 1..84</a> %e A203564 Some solutions for n=5 and k=3: %e A203564 ..2..2..2....1..2..0....2..1..0....2..1..0....1..2..0....2..1..0....1..2..0 %e A203564 ..2..2..2....2..0..1....1..1..1....1..1..1....2..0..1....2..1..0....0..1..2 %e A203564 ..2..2..2....0..1..2....2..0..1....1..1..1....0..1..2....0..2..1....1..2..0 %e A203564 ..2..2..2....2..0..1....0..2..1....0..2..1....2..0..1....0..1..2....2..0..1 %e A203564 ..2..2..2....0..2..1....0..1..2....1..0..2....0..2..1....1..0..2....1..0..2 %Y A203564 Diagonal is A202779. %K A203564 nonn,tabl %O A203564 1,1 %A A203564 _R. H. Hardin_, Jan 03 2012