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 A281601 #4 Jan 25 2017 10:37:56 %S A281601 11,110,1283,16198,203276,2563481,32354824,408458506,5156857179, %T A281601 65107404580,822011501060,10378295092963,131031076361292, %U A281601 1654331920396230,20886756502623605,263705605573971334 %N A281601 Number of nX4 0..2 arrays with no element equal to more than one of its horizontal, diagonal or antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. %C A281601 Column 4 of A281605. %H A281601 R. H. Hardin, <a href="/A281601/b281601.txt">Table of n, a(n) for n = 1..210</a> %F A281601 Empirical: a(n) = 13*a(n-1) +3*a(n-2) -87*a(n-3) -125*a(n-4) -116*a(n-5) +69*a(n-6) +522*a(n-7) -148*a(n-8) -199*a(n-9) +690*a(n-10) -105*a(n-11) -265*a(n-12) -155*a(n-13) -84*a(n-14) -23*a(n-15) -13*a(n-16) for n>18 %e A281601 Some solutions for n=4 %e A281601 ..0..1..1..0. .0..1..0..1. .0..1..2..1. .0..1..0..1. .0..0..1..0 %e A281601 ..2..0..2..0. .0..1..0..2. .2..1..2..1. .2..1..0..2. .1..2..1..0 %e A281601 ..2..1..1..0. .0..2..1..0. .0..1..2..1. .0..1..0..1. .1..2..1..2 %e A281601 ..0..0..2..0. .1..2..1..2. .0..1..2..1. .0..1..0..1. .1..0..1..2 %Y A281601 Cf. A281605. %K A281601 nonn %O A281601 1,1 %A A281601 _R. H. Hardin_, Jan 25 2017