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 A302667 #4 Apr 11 2018 11:57:40 %S A302667 3,146,760,6110,42367,316977,2320879,17037458,125456575,920577056, %T A302667 6771994976,49750520267,365694010435,2687564829667,19752736970617, %U A302667 145173898526499,1066965083553746,7841771608569736,57633622628200420 %N A302667 Number of nX5 0..1 arrays with every element equal to 1, 2, 3 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A302667 Column 5 of A302670. %H A302667 R. H. Hardin, <a href="/A302667/b302667.txt">Table of n, a(n) for n = 1..210</a> %e A302667 Some solutions for n=5 %e A302667 ..0..1..1..1..0. .0..1..1..1..1. .0..1..1..1..1. .0..0..1..1..0 %e A302667 ..1..0..0..0..0. .0..0..0..1..0. .1..0..0..0..1. .0..1..1..0..0 %e A302667 ..0..0..1..1..1. .1..1..1..0..0. .1..1..1..1..0. .0..0..1..1..0 %e A302667 ..1..0..1..0..0. .0..0..1..0..1. .0..0..0..0..1. .1..0..0..0..1 %e A302667 ..1..1..0..0..0. .0..0..0..1..0. .0..0..1..1..0. .1..1..1..1..1 %Y A302667 Cf. A302670. %K A302667 nonn %O A302667 1,1 %A A302667 _R. H. Hardin_, Apr 11 2018