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 A281052 #4 Jan 13 2017 16:55:53 %S A281052 1,34,239,1022,3416,10112,27635,71419,177320,426696,1002035,2306828, %T A281052 5224307,11669686,25762564,56301813,121961820,262154625,559637795, %U A281052 1187392495,2505484374,5260557953,10995496220,22888340830,47465895442 %N A281052 Number of nX4 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards. %C A281052 Column 4 of A281056. %H A281052 R. H. Hardin, <a href="/A281052/b281052.txt">Table of n, a(n) for n = 1..210</a> %F A281052 Empirical: a(n) = 3*a(n-1) +3*a(n-2) -11*a(n-3) -9*a(n-4) +18*a(n-5) +17*a(n-6) -12*a(n-7) -15*a(n-8) +3*a(n-9) +6*a(n-10) -a(n-12) for n>14 %e A281052 Some solutions for n=4 %e A281052 ..0..1..0..0. .0..0..0..1. .0..1..1..0. .0..0..0..1. .0..0..1..0 %e A281052 ..0..1..1..1. .0..1..0..1. .0..0..0..1. .1..1..0..1. .1..1..0..1 %e A281052 ..0..1..0..0. .0..0..0..1. .0..1..0..0. .0..1..0..0. .0..1..0..0 %e A281052 ..0..1..0..1. .0..1..0..0. .0..1..1..0. .1..0..1..0. .0..1..0..1 %Y A281052 Cf. A281056. %K A281052 nonn %O A281052 1,2 %A A281052 _R. H. Hardin_, Jan 13 2017