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 A302529 #4 Apr 09 2018 09:25:30 %S A302529 0,10,28,42,100,290,730,1700,4246,10758,26632,65846,164130,408716, %T A302529 1015998,2527374,6288152,15643694,38924730,96845564,240934118, %U A302529 599472054,1491590968,3711076182,9233281458,22973573260,57160260398,142218013758 %N A302529 Number of 3Xn 0..1 arrays with every element equal to 1, 2, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A302529 Row 3 of A302528. %H A302529 R. H. Hardin, <a href="/A302529/b302529.txt">Table of n, a(n) for n = 1..210</a> %F A302529 Empirical: a(n) = 4*a(n-1) -4*a(n-2) +6*a(n-3) -10*a(n-4) -24*a(n-5) +37*a(n-6) -22*a(n-7) +72*a(n-8) +18*a(n-9) -108*a(n-10) +24*a(n-11) -24*a(n-12) +24*a(n-13) +8*a(n-14) -8*a(n-15) for n>17 %e A302529 Some solutions for n=5 %e A302529 ..0..1..0..1..0. .0..0..1..0..0. .0..1..0..1..0. .0..0..0..0..0 %e A302529 ..1..0..1..0..1. .0..0..1..1..1. .0..0..1..0..0. .0..0..0..0..0 %e A302529 ..0..1..0..1..0. .0..1..0..0..1. .0..1..0..1..0. .1..1..1..1..0 %Y A302529 Cf. A302528. %K A302529 nonn %O A302529 1,2 %A A302529 _R. H. Hardin_, Apr 09 2018