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 A302683 #4 Apr 11 2018 12:30:44 %S A302683 16,9,11,33,63,187,661,1837,5075,15661,46975,135191,398107,1187251, %T A302683 3492697,10253381,30301323,89476359,263483993,776726391,2291909243, %U A302683 6757855265,19921284797,58748244533,173250475905,510831651353 %N A302683 Number of 5Xn 0..1 arrays with every element equal to 0, 1, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A302683 Row 5 of A302680. %H A302683 R. H. Hardin, <a href="/A302683/b302683.txt">Table of n, a(n) for n = 1..210</a> %F A302683 Empirical: a(n) = a(n-1) +a(n-2) +10*a(n-3) +13*a(n-4) -7*a(n-6) -6*a(n-7) -11*a(n-8) -6*a(n-9) -4*a(n-10) -2*a(n-11) for n>16 %e A302683 Some solutions for n=5 %e A302683 ..0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0 %e A302683 ..0..1..1..1..0. .0..1..0..0..0. .0..1..0..1..0. .0..1..0..1..0 %e A302683 ..0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .0..1..0..0..0 %e A302683 ..0..1..0..1..0. .0..1..1..1..0. .0..1..0..1..0. .0..1..0..1..0 %e A302683 ..0..0..0..1..0. .0..1..0..1..0. .0..1..0..0..0. .0..1..0..1..0 %Y A302683 Cf. A302680. %K A302683 nonn %O A302683 1,1 %A A302683 _R. H. Hardin_, Apr 11 2018