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 A268029 #4 Jan 24 2016 14:12:41 %S A268029 159,25281,4019679,528293442,64075543999,7174118632004, %T A268029 755621980815702,75590527336679325,7241209148835741551, %U A268029 668367812123759143291,59734274767845583736579,5189965129983559255913520 %N A268029 Number of 5Xn 0..2 arrays with every repeated value in every row greater than or equal to, and in every column greater than, the previous repeated value. %C A268029 Row 5 of A268026. %H A268029 R. H. Hardin, <a href="/A268029/b268029.txt">Table of n, a(n) for n = 1..45</a> %e A268029 Some solutions for n=2 %e A268029 ..0..0....2..1....0..0....1..2....1..1....0..2....0..1....2..0....0..1....1..0 %e A268029 ..2..2....2..2....0..0....0..1....2..1....0..0....0..1....1..1....2..1....0..1 %e A268029 ..1..1....0..0....2..2....1..2....0..2....2..1....1..0....2..2....0..2....1..2 %e A268029 ..0..2....1..0....1..1....0..1....0..2....2..2....2..2....2..2....0..0....0..2 %e A268029 ..1..2....0..1....2..0....2..0....2..0....0..2....0..1....0..1....2..2....0..1 %Y A268029 Cf. A268026. %K A268029 nonn %O A268029 1,1 %A A268029 _R. H. Hardin_, Jan 24 2016