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 A302269 #7 Apr 05 2018 04:10:17 %S A302269 16,512,4386,45717,429854,4289139,41994750,411922598,4057777774, %T A302269 39861518663,392139398276,3857829901549,37946634409412, %U A302269 373356037411323,3673267587608222,36140816911747227,355597872011530803 %N A302269 Number of 5 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 A302269 Row 5 of A302265. %H A302269 R. H. Hardin, <a href="/A302269/b302269.txt">Table of n, a(n) for n = 1..210</a> %e A302269 Some solutions for n=5: %e A302269 0 0 0 1 0 0 0 0 1 1 0 0 0 1 0 0 0 0 1 1 %e A302269 1 1 0 1 1 1 1 0 1 1 1 1 0 1 0 1 1 0 1 1 %e A302269 1 0 0 1 0 1 0 0 0 0 1 1 0 1 1 1 0 0 1 0 %e A302269 1 0 1 1 0 1 0 1 1 1 0 1 0 1 0 0 0 1 0 1 %e A302269 0 0 1 1 1 0 1 1 1 0 1 0 1 0 1 1 0 1 0 0 %Y A302269 Cf. A302265. %K A302269 nonn %O A302269 1,1 %A A302269 _R. H. Hardin_, Apr 04 2018