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 A282644 #9 Feb 21 2025 05:17:59 %S A282644 24,201,1601,15460,133118,1190848,10614316,94161619,838433062, %T A282644 7454215075,66292530149,589611150641,5243462854609,46633173607625, %U A282644 414729611119231,3688374141775373,32802445652275246,291727015058062232,2594462295371896780,23073742634349717259 %N A282644 Number of n X 5 0..1 arrays with no 1 equal to more than one of its king-move neighbors. %C A282644 Column 5 of A282647. %H A282644 R. H. Hardin, <a href="/A282644/b282644.txt">Table of n, a(n) for n = 1..210</a> %F A282644 Empirical: a(n) = 4*a(n-1) +31*a(n-2) +127*a(n-3) -103*a(n-4) -166*a(n-5) -1614*a(n-6) +2383*a(n-7) -4797*a(n-8) +13056*a(n-9) -10639*a(n-10) +8408*a(n-11) -11834*a(n-12) +3060*a(n-13) -2498*a(n-14) +4177*a(n-15) +266*a(n-16) +332*a(n-17) -384*a(n-18) +45*a(n-19) +21*a(n-20) +30*a(n-21). %e A282644 Some solutions for n=4: %e A282644 ..0..1..0..0..0. .0..1..0..0..1. .0..0..1..0..0. .0..1..1..0..0 %e A282644 ..0..0..0..0..1. .1..0..0..0..0. .0..0..0..0..1. .0..0..0..0..0 %e A282644 ..0..1..0..0..0. .0..0..0..0..0. .0..0..0..0..1. .1..0..0..1..0 %e A282644 ..1..0..0..1..1. .1..0..0..1..1. .0..0..1..0..0. .0..1..0..1..0 %Y A282644 Cf. A282647. %K A282644 nonn %O A282644 1,1 %A A282644 _R. H. Hardin_, Feb 20 2017