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 A298965 #4 Jan 30 2018 13:27:51 %S A298965 4,32,219,1575,11283,80972,581057,4169867,29924442,214748731, %T A298965 1541115372,11059607816,79367792570,569572322542,4087459410676, %U A298965 29333104460805,210505091515979,1510661567154766,10841060204501930,77799415112548482 %N A298965 Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3, 4 or 5 king-move adjacent elements, with upper left element zero. %C A298965 Column 3 of A298970. %H A298965 R. H. Hardin, <a href="/A298965/b298965.txt">Table of n, a(n) for n = 1..210</a> %F A298965 Empirical: a(n) = 7*a(n-1) +3*a(n-2) -11*a(n-3) -11*a(n-4) +2*a(n-5) +19*a(n-6) -8*a(n-7) -12*a(n-8) %e A298965 Some solutions for n=5 %e A298965 ..0..0..0. .0..1..1. .0..1..1. .0..1..1. .0..0..1. .0..0..1. .0..0..1 %e A298965 ..1..1..1. .1..0..1. .0..0..0. .1..0..1. .0..0..0. .0..1..0. .0..0..0 %e A298965 ..1..1..0. .0..0..1. .0..0..1. .0..0..0. .1..1..1. .0..0..0. .1..1..0 %e A298965 ..0..0..0. .0..0..0. .1..0..1. .0..0..1. .0..1..1. .0..1..1. .0..1..1 %e A298965 ..0..1..0. .1..1..0. .0..0..0. .1..1..1. .0..0..1. .1..1..1. .0..0..1 %Y A298965 Cf. A298970. %K A298965 nonn %O A298965 1,1 %A A298965 _R. H. Hardin_, Jan 30 2018