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 A264560 #3 Nov 17 2015 18:05:19 %S A264560 1,1,1,2,3,1,4,24,15,2,12,316,888,156,4,36,6080,84672,58368,2032,8, %T A264560 144,149824,17444160,66194496,7019136,30912,24,576,5728896,5356808640 %N A264560 T(n,k)=Number of nXk arrays of permutations of 0..n*k-1 with rows nondecreasing modulo 2 and columns nondecreasing modulo 3. %C A264560 Table starts %C A264560 ..1.....1.......2........4.......12.........36.....144.576 %C A264560 ..1.....3......24......316.....6080.....149824.5728896 %C A264560 ..1....15.....888....84672.17444160.5356808640 %C A264560 ..2...156...58368.66194496 %C A264560 ..4..2032.7019136 %C A264560 ..8.30912 %C A264560 .24 %e A264560 Some solutions for n=3 k=4 %e A264560 ..4..6..1..9....6..4..9..3....0.11..9..1....0..9..1..3....6..4.10..0 %e A264560 .11..3..7..5....8.10..0..7....6..5..3..7....6..8..4..7....9..1..7..3 %e A264560 ..2..0.10..8....2..1..5.11....4..8..2.10...10..2.11..5....8..2.11..5 %Y A264560 Row 1 is A111942(n+1). %K A264560 nonn,tabl %O A264560 1,4 %A A264560 _R. H. Hardin_, Nov 17 2015