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 A281059 #4 Jan 13 2017 17:01:10 %S A281059 0,29,376,1022,2452,5400,10570,19892,36616,66354,118926,211382,373266, %T A281059 655580,1146156,1995858,3463242,5990498,10332426,17775144,30506480, %U A281059 52242450,89285638,152311246,259377954,440998484,748670868,1269219570 %N A281059 Number of 4Xn 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 A281059 Row 4 of A281056. %H A281059 R. H. Hardin, <a href="/A281059/b281059.txt">Table of n, a(n) for n = 1..210</a> %F A281059 Empirical: a(n) = 6*a(n-1) -12*a(n-2) +5*a(n-3) +12*a(n-4) -12*a(n-5) -3*a(n-6) +6*a(n-7) -a(n-9) for n>17 %e A281059 Some solutions for n=4 %e A281059 ..0..1..1..0. .0..1..1..0. .0..0..1..0. .0..1..1..0. .0..1..1..0 %e A281059 ..1..0..1..0. .0..0..1..1. .1..0..0..1. .1..0..1..0. .0..1..0..1 %e A281059 ..0..1..0..1. .1..0..1..0. .1..1..0..0. .1..0..0..1. .0..1..0..1 %e A281059 ..0..1..1..1. .0..1..0..1. .0..1..0..1. .1..0..1..0. .1..1..0..1 %Y A281059 Cf. A281056. %K A281059 nonn %O A281059 1,2 %A A281059 _R. H. Hardin_, Jan 13 2017