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 A302671 #4 Apr 11 2018 12:00:43 %S A302671 0,111,691,4267,42367,352174,3204956,28324200,248482982,2223806395, %T A302671 19612845211,174147277424,1545345042448,13690754212668, %U A302671 121518036637399,1077456338230779,9556752221812425,84773605649902772,751847387040101232 %N A302671 Number of 5Xn 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 A302671 Row 5 of A302670. %H A302671 R. H. Hardin, <a href="/A302671/b302671.txt">Table of n, a(n) for n = 1..210</a> %e A302671 Some solutions for n=5 %e A302671 ..0..0..0..1..1. .0..1..1..1..1. .0..0..0..1..1. .0..0..1..1..0 %e A302671 ..1..1..1..0..1. .0..0..0..0..1. .1..1..1..0..1. .1..0..0..0..0 %e A302671 ..0..0..1..0..0. .1..1..1..1..0. .0..0..1..0..0. .0..1..1..1..1 %e A302671 ..0..1..1..0..1. .0..0..0..1..1. .0..0..0..1..0. .0..0..0..0..1 %e A302671 ..1..1..0..1..0. .1..1..1..0..0. .1..1..1..1..1. .1..1..1..0..0 %Y A302671 Cf. A302670. %K A302671 nonn %O A302671 1,2 %A A302671 _R. H. Hardin_, Apr 11 2018