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 A268007 #5 Jan 24 2016 09:25:25 %S A268007 4,159,7445,381958,18691624,911680225,43653230106,2074179818184, %T A268007 97646068246936,4569116947346091,212625847203245237, %U A268007 9853280365275338623,455001756707087106187,20951793886914002899807,962541121729004548522176 %N A268007 Number of nX3 0..3 arrays with every repeated value in every row and column unequal to the previous repeated value, and new values introduced in row-major sequential order. %C A268007 Column 3 of A268009. %H A268007 R. H. Hardin, <a href="/A268007/b268007.txt">Table of n, a(n) for n = 1..210</a> %H A268007 R. H. Hardin, <a href="/A268007/a268007.txt">Empirical recurrence of order 75</a> %F A268007 Empirical recurrence of order 75 (see link above) %e A268007 Some solutions for n=3 %e A268007 ..0..1..0....0..0..1....0..0..1....0..1..0....0..1..0....0..1..1....0..1..2 %e A268007 ..1..2..2....2..3..0....1..2..0....1..2..3....1..2..3....2..3..2....2..2..0 %e A268007 ..1..2..1....0..3..1....0..0..1....0..0..1....3..2..0....0..0..2....2..1..3 %Y A268007 Cf. A268009. %K A268007 nonn %O A268007 1,1 %A A268007 _R. H. Hardin_, Jan 24 2016