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 A209684 #8 Oct 30 2022 06:36:29 %S A209684 1,1,8,1,14,96,1,15,608,4608,1,15,1243,246038,331776,1,15,1508, %T A209684 2143147,166075313,95551488,1,15,1549,6716352,6713848491, %U A209684 1008907523438,41278242816,1,15,1551,11315839,66825091608,336865786047147 %N A209684 T(n,k) = Number of n X n 0..k arrays with every element equal to a diagonal or antidiagonal reflection, and new values 0 upwards introduced in row major order. %C A209684 Table starts %C A209684 ......1.........1..........1...........1............1............1............1 %C A209684 ......8........14.........15..........15...........15...........15...........15 %C A209684 .....96.......608.......1243........1508.........1549.........1551.........1551 %C A209684 ...4608....246038....2143147.....6716352.....11315839.....13575355.....14164693 %C A209684 .331776.166075313.6713848491.66825091608.268997909000.584728215424.847881355388 %H A209684 R. H. Hardin, <a href="/A209684/b209684.txt">Table of n, a(n) for n = 1..988</a> %e A209684 Some solutions for n=3, k=3 %e A209684 ..0..1..0....0..0..1....0..1..0....0..0..1....0..1..0....0..1..0....0..1..1 %e A209684 ..1..2..3....0..1..1....1..1..1....2..2..0....0..1..1....2..3..1....1..0..2 %e A209684 ..2..3..1....2..1..0....1..1..1....3..2..0....0..0..1....2..2..1....3..2..1 %Y A209684 Column 1 is A209586/2. %K A209684 nonn,tabl %O A209684 1,3 %A A209684 _R. H. Hardin_, Mar 11 2012