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 A282787 #6 May 26 2024 01:19:21 %S A282787 2,16,318,1952,16584,119176,832218,5780340,39020884,260919192, %T A282787 1725189008,11301829056,73518360532,475188725292,3055000301306, %U A282787 19549420762100,124588203699132,791140457595836,5007656160113482,31605725372441888 %N A282787 Number of n X 4 0..1 arrays with no 1 equal to more than one of its king-move neighbors, with the exception of exactly one element. %C A282787 Column 4 of A282791. %H A282787 R. H. Hardin, <a href="/A282787/b282787.txt">Table of n, a(n) for n = 1..210</a> %F A282787 Empirical: a(n) = 4*a(n-1) +28*a(n-2) +26*a(n-3) -404*a(n-4) -1508*a(n-5) -2631*a(n-6) -1242*a(n-7) +1650*a(n-8) +5880*a(n-9) +5486*a(n-10) +2762*a(n-11) -2635*a(n-12) -3886*a(n-13) -3543*a(n-14) -896*a(n-15) -39*a(n-16) +322*a(n-17) -49*a(n-18). %e A282787 Some solutions for n=4 %e A282787 ..0..0..1..0. .1..0..1..0. .0..1..0..0. .1..1..0..0. .0..0..1..0 %e A282787 ..0..0..0..0. .0..0..1..0. .0..0..0..1. .0..0..0..0. .1..0..0..1 %e A282787 ..1..1..1..0. .1..0..1..0. .0..0..0..0. .0..0..0..0. .0..1..0..1 %e A282787 ..0..0..0..0. .1..0..0..0. .0..1..1..1. .0..1..1..1. .0..0..0..0 %Y A282787 Cf. A282791. %K A282787 nonn %O A282787 1,1 %A A282787 _R. H. Hardin_, Feb 21 2017