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 A326100 #4 Jun 06 2019 07:52:12 %S A326100 4,29,161,929,5383,31236,181227,1051456,6100399,35393679,205349281, %T A326100 1191408438,6912388772,40104734047,232682180647,1349990181408, %U A326100 7832458355125,45442851903417,263653210203742,1529679858088141 %N A326100 Number of nX3 0..1 arrays with every element equal to 0, 1, 2, 3 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. %C A326100 Column 3 of A326105. %H A326100 R. H. Hardin, <a href="/A326100/b326100.txt">Table of n, a(n) for n = 1..210</a> %F A326100 Empirical: a(n) = 5*a(n-1) +5*a(n-2) -2*a(n-3) -3*a(n-6) -2*a(n-7) -a(n-8) -a(n-9) %e A326100 Some solutions for n=5 %e A326100 ..0..0..0. .0..1..0. .0..1..0. .0..0..1. .0..1..1. .0..0..1. .0..1..1 %e A326100 ..0..1..1. .0..1..0. .1..0..0. .0..0..0. .0..1..0. .0..1..1. .1..0..1 %e A326100 ..0..0..0. .1..0..0. .1..1..1. .1..1..1. .0..1..0. .1..0..0. .0..1..0 %e A326100 ..0..1..0. .1..1..0. .1..0..1. .1..0..1. .0..0..1. .1..1..0. .1..0..0 %e A326100 ..0..1..0. .1..1..0. .0..1..1. .1..1..1. .0..1..1. .1..1..0. .1..1..1 %Y A326100 Cf. A326105. %K A326100 nonn %O A326100 1,1 %A A326100 _R. H. Hardin_, Jun 06 2019