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 A283036 #8 Nov 16 2021 21:42:13 %S A283036 0,4,16,68,256,924,3232,11044,37104,122984,403280,1310760,4228960, %T A283036 13558932,43239776,137251068,433883696,1366668772,4290998336, %U A283036 13433966724,41949331616,130685405648,406258440928,1260465716560,3903760205760 %N A283036 Number of n X 2 0..1 arrays with no 1 equal to more than one of its horizontal and vertical neighbors, with the exception of exactly one element. %C A283036 Column 2 of A283042. %H A283036 R. H. Hardin, <a href="/A283036/b283036.txt">Table of n, a(n) for n = 1..210</a> %F A283036 Empirical: a(n) = 4*a(n-1) +2*a(n-2) -12*a(n-3) -11*a(n-4) +4*a(n-5) +6*a(n-6) -a(n-8). %F A283036 Empirical: G.f.: -4*x^2*(x-1)*(1+x)/(x^4-3*x^2-2*x+1)^2. - _R. J. Mathar_, Mar 02 2017 %e A283036 Some solutions for n=4 %e A283036 ..1..0. .1..1. .1..1. .1..0. .1..1. .1..1. .0..1. .0..0. .1..1. .1..1 %e A283036 ..0..0. .0..1. .1..0. .1..1. .0..0. .0..1. .0..1. .0..1. .1..0. .0..0 %e A283036 ..1..1. .0..0. .0..1. .1..0. .0..1. .0..0. .0..1. .1..0. .0..0. .1..0 %e A283036 ..0..1. .1..0. .0..1. .0..1. .1..1. .0..1. .1..0. .1..1. .1..0. .1..1 %Y A283036 Cf. A283042. %K A283036 nonn %O A283036 1,2 %A A283036 _R. H. Hardin_, Feb 27 2017