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 A302270 #7 Apr 05 2018 04:10:11 %S A302270 32,2048,23516,353229,4608075,64975832,893462062,12314612510, %T A302270 170772674650,2358411011162,32642910388558,451854951125666, %U A302270 6252677767027315,86568880314498494,1198444427129769914 %N A302270 Number of 6 X n 0..1 arrays with every element equal to 0, 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A302270 Row 6 of A302265. %H A302270 R. H. Hardin, <a href="/A302270/b302270.txt">Table of n, a(n) for n = 1..210</a> %e A302270 Some solutions for n=5: %e A302270 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 %e A302270 0 1 1 0 0 0 1 1 1 0 0 1 1 0 1 1 0 1 1 0 %e A302270 1 1 1 0 1 1 0 0 1 1 0 1 0 1 1 0 0 1 1 0 %e A302270 0 0 0 0 0 1 0 0 1 1 1 1 0 1 0 0 1 1 0 0 %e A302270 0 1 1 1 0 1 1 1 0 0 0 0 1 1 0 1 1 0 0 1 %e A302270 0 0 0 1 1 0 0 0 1 1 0 0 1 0 1 1 1 0 0 1 %Y A302270 Cf. A302265. %K A302270 nonn %O A302270 1,1 %A A302270 _R. H. Hardin_, Apr 04 2018