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 A267929 #4 Jan 22 2016 10:06:55 %S A267929 16,256,3600,49284,646416,8248384,102657424,1251956689,15001350400, %T A267929 177032245504,2061337861696,23718185697424,270017722670656, %U A267929 3044657592269056,34033540434657856,377424464034508969 %N A267929 Number of nX2 0..3 arrays with every repeated value in every row and column greater than the previous repeated value. %C A267929 Column 2 of A267933. %H A267929 R. H. Hardin, <a href="/A267929/b267929.txt">Table of n, a(n) for n = 1..210</a> %F A267929 Empirical: a(n) = 65*a(n-1) -1714*a(n-2) +21994*a(n-3) -104609*a(n-4) -629015*a(n-5) +9424776*a(n-6) -16529832*a(n-7) -255376098*a(n-8) +1037637378*a(n-9) +3611188980*a(n-10) -20939962212*a(n-11) -32646831786*a(n-12) +213582240666*a(n-13) +202683094344*a(n-14) -1065454174440*a(n-15) -388324470141*a(n-16) +2871948084957*a(n-17) -843801825042*a(n-18) -3200868080118*a(n-19) +3106724901291*a(n-20) -847288609443*a(n-21) %e A267929 Some solutions for n=4 %e A267929 ..1..1....1..3....3..2....2..3....1..0....3..3....1..3....0..3....3..3....0..2 %e A267929 ..3..2....2..0....1..2....3..0....0..1....1..1....1..2....0..1....0..3....3..2 %e A267929 ..1..2....3..2....0..3....3..2....1..1....3..0....0..3....3..3....2..1....3..1 %e A267929 ..1..3....3..0....3..3....0..3....0..3....3..1....3..3....0..1....3..3....1..0 %Y A267929 Cf. A267933. %K A267929 nonn %O A267929 1,1 %A A267929 _R. H. Hardin_, Jan 22 2016