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 A268178 #5 Jan 28 2016 07:33:58 %S A268178 5,187,9054,494098,25770278,1339895662,68390077014,3463876525750, %T A268178 173821913942582,8669861062288198,430055421776241462, %U A268178 21243060963214339750,1045628843830767904502,51323318125992835472806 %N A268178 Number of nX3 0..3 arrays with every repeated value in every row equal to, and in every column unequal to, the previous repeated value, and new values introduced in row-major sequential order. %C A268178 Column 3 of A268180. %H A268178 R. H. Hardin, <a href="/A268178/b268178.txt">Table of n, a(n) for n = 1..210</a> %F A268178 Empirical: a(n) = 108*a(n-1) -2343*a(n-2) -95508*a(n-3) +3418760*a(n-4) +23547420*a(n-5) -1342943052*a(n-6) -883192104*a(n-7) +173217160160*a(n-8) -342228942720*a(n-9) -5613350923584*a(n-10) +8457106112640*a(n-11) +55966350739968*a(n-12) -69629468894208*a(n-13) -198751111188480*a(n-14) +222436679786496*a(n-15) +215814907920384*a(n-16) -228509902503936*a(n-17) for n>19 %e A268178 Some solutions for n=3 %e A268178 ..0..1..1....0..1..0....0..1..2....0..1..2....0..1..0....0..0..1....0..1..1 %e A268178 ..2..3..1....1..0..2....3..2..2....3..2..0....1..1..0....0..0..2....2..2..2 %e A268178 ..1..3..2....3..0..3....3..1..3....3..2..1....1..2..1....1..3..2....0..3..2 %Y A268178 Cf. A268180. %K A268178 nonn %O A268178 1,1 %A A268178 _R. H. Hardin_, Jan 28 2016