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 A264839 #5 Apr 23 2021 14:35:26 %S A264839 1,2,22,409,4800,147550,5692511,389627606 %N A264839 Number of 3 X n arrays of permutations of 0..n*3-1 with rows nondecreasing modulo 5 and columns nondecreasing modulo 7. %C A264839 Row 3 of A264837. %e A264839 Some solutions for n=4 %e A264839 ..2..7..3..8....1..7..8..9...10..0..2..7...10..0..7..2...10..0..2..7 %e A264839 .10..0..4..9...10..0..2..3....3..8..4..9....5..8..4..9....3..8..4..9 %e A264839 ..5..1.11..6....5..6.11..4....5..1.11..6....6..1.11..3....5..1..6.11 %Y A264839 Cf. A264837. %K A264839 nonn %O A264839 1,2 %A A264839 _R. H. Hardin_, Nov 26 2015