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 A299735 #4 Feb 18 2018 10:12:15 %S A299735 4,32,220,1578,11303,81105,582032,4177161,29979239,215160247, %T A299735 1544201029,11082704750,79540390044,570860083491,4097053535956, %U A299735 29404486634726,211035522699946,1514598516808216,10870248941079889,78015599995840787 %N A299735 Number of nX3 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 A299735 Column 3 of A299740. %H A299735 R. H. Hardin, <a href="/A299735/b299735.txt">Table of n, a(n) for n = 1..210</a> %F A299735 Empirical: a(n) = 8*a(n-1) -4*a(n-2) -13*a(n-3) -6*a(n-4) +5*a(n-5) +23*a(n-6) -20*a(n-7) -12*a(n-8) %e A299735 Some solutions for n=5 %e A299735 ..0..1..1. .0..0..0. .0..0..0. .0..0..1. .0..0..0. .0..1..0. .0..0..0 %e A299735 ..0..0..0. .0..0..0. .0..0..0. .1..1..1. .0..0..0. .0..0..0. .1..1..1 %e A299735 ..1..1..1. .0..0..0. .0..0..0. .0..0..0. .1..1..1. .1..1..1. .1..1..1 %e A299735 ..1..1..1. .1..1..1. .1..1..1. .0..0..0. .1..1..1. .1..1..1. .1..1..1 %e A299735 ..1..1..1. .0..0..0. .0..1..1. .0..0..0. .1..1..1. .1..1..1. .1..1..1 %Y A299735 Cf. A299740. %K A299735 nonn %O A299735 1,1 %A A299735 _R. H. Hardin_, Feb 18 2018