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 A282992 #8 Oct 19 2023 19:27:40 %S A282992 13,98,803,6547,53389,435027,3546870,28911809,235681253,1921212987, %T A282992 15661161199,127665372304,1040691953095,8483425185009,69154476414585, %U A282992 563727672983607,4595348063993330,37459973798636833,305363079492664703,2489233196683020273,20291522858244231419 %N A282992 Number of n X 4 0..1 arrays with no 1 equal to more than one of its horizontal and vertical neighbors. %C A282992 Column 4 of A282996. %H A282992 R. H. Hardin, <a href="/A282992/b282992.txt">Table of n, a(n) for n = 1..210</a> %F A282992 Empirical: a(n) = 4*a(n-1) +27*a(n-2) +59*a(n-3) -10*a(n-4) -134*a(n-5) +12*a(n-6) +43*a(n-7) -55*a(n-8) +42*a(n-9) -90*a(n-10) +58*a(n-11) -30*a(n-12) +6*a(n-13) -2*a(n-14) +a(n-15). %e A282992 Some solutions for n=5: %e A282992 ..0..0..1..0. .0..0..0..1. .1..0..1..0. .1..0..0..1. .1..0..0..1 %e A282992 ..0..0..1..0. .1..1..0..0. .0..0..0..1. .1..0..0..0. .0..0..1..0 %e A282992 ..0..1..0..0. .0..0..1..1. .1..0..0..0. .0..0..0..1. .0..1..0..0 %e A282992 ..0..0..0..0. .1..0..0..0. .0..0..0..1. .1..1..0..1. .1..0..0..1 %e A282992 ..1..1..0..1. .0..0..1..1. .1..1..0..1. .0..0..1..0. .0..0..0..0 %Y A282992 Cf. A282996. %K A282992 nonn %O A282992 1,1 %A A282992 _R. H. Hardin_, Feb 26 2017