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 A268102 #5 Jan 26 2016 12:17:33 %S A268102 615,378225,232608375,134114290153,74223748225767,39628019998736362, %T A268102 20521193142295758827,10349487304333681128069, %U A268102 5100109128493173791160887,2462335083143368720711957677,1167299758811224888022222919608 %N A268102 Number of nX4 0..4 arrays with every repeated value in every row and column greater than or equal to the previous repeated value. %C A268102 Column 4 of A268103. %H A268102 R. H. Hardin, <a href="/A268102/b268102.txt">Table of n, a(n) for n = 1..16</a> %e A268102 Some solutions for n=5 %e A268102 ..0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0 %e A268102 ..0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0 %e A268102 ..0..0..0..3....0..0..0..4....0..0..0..0....0..0..0..4....0..0..0..4 %e A268102 ..0..0..0..0....0..0..1..4....0..0..3..0....0..0..1..1....0..0..2..1 %e A268102 ..2..2..4..0....1..2..0..3....2..3..2..2....4..0..2..2....4..2..3..2 %Y A268102 Cf. A268103. %K A268102 nonn %O A268102 1,1 %A A268102 _R. H. Hardin_, Jan 26 2016