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 A299736 #4 Feb 18 2018 10:12:54 %S A299736 8,128,1578,21111,280642,3742524,49914496,665759775,8880043786, %T A299736 118444355690,1579842808694,21072374550353,281069094117722, %U A299736 3748976470182616,50004873889561202,666978689750754527 %N A299736 Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5 or 8 king-move adjacent elements, with upper left element zero. %C A299736 Column 4 of A299740. %H A299736 R. H. Hardin, <a href="/A299736/b299736.txt">Table of n, a(n) for n = 1..210</a> %F A299736 Empirical: a(n) = 15*a(n-1) -16*a(n-2) -74*a(n-3) -143*a(n-4) +359*a(n-5) +1265*a(n-6) -1482*a(n-7) -3403*a(n-8) +1254*a(n-9) +9324*a(n-10) +1300*a(n-11) -12152*a(n-12) -9082*a(n-13) +5339*a(n-14) +10470*a(n-15) +1214*a(n-16) -3095*a(n-17) -2072*a(n-18) +764*a(n-19) -3*a(n-20) -161*a(n-21) -154*a(n-22) +112*a(n-23) +48*a(n-24) %e A299736 Some solutions for n=5 %e A299736 ..0..0..1..1. .0..0..0..0. .0..0..0..1. .0..0..1..1. .0..0..1..1 %e A299736 ..0..0..0..1. .0..1..1..1. .0..0..0..1. .0..0..0..1. .0..0..0..1 %e A299736 ..1..1..0..0. .1..0..0..0. .0..0..0..1. .1..1..0..0. .1..1..0..0 %e A299736 ..1..0..1..1. .1..0..0..0. .1..1..1..0. .1..1..0..0. .1..1..0..1 %e A299736 ..1..0..0..1. .1..0..0..0. .1..1..1..1. .1..0..1..1. .1..0..1..1 %Y A299736 Cf. A299740. %K A299736 nonn %O A299736 1,1 %A A299736 _R. H. Hardin_, Feb 18 2018