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 A302275 #7 Apr 05 2018 04:09:42 %S A302275 3,27,74,283,1219,3854,14639,63093,222254,867269,3651231,13909218, %T A302275 55448467,230250019,911892066,3685592711,15189545391,61267056156, %U A302275 249395546907,1024061684191,4165273608452,17011882082021,69737883682027 %N A302275 Number of n X 5 0..1 arrays with every element equal to 1, 2 or 4 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A302275 Column 5 of A302278. %H A302275 R. H. Hardin, <a href="/A302275/b302275.txt">Table of n, a(n) for n = 1..210</a> %e A302275 Some solutions for n=5: %e A302275 0 1 0 1 1 0 1 1 1 0 0 1 0 1 1 0 0 1 0 0 %e A302275 1 0 1 0 0 1 0 0 0 0 1 0 0 0 0 1 1 0 1 1 %e A302275 0 1 0 1 0 0 1 0 1 1 1 0 0 0 1 0 0 0 0 0 %e A302275 0 0 0 0 1 0 0 0 0 0 1 1 1 1 0 1 1 0 1 1 %e A302275 1 1 1 1 0 1 1 1 1 0 0 0 1 0 1 1 0 0 0 1 %Y A302275 Cf. A302278. %K A302275 nonn %O A302275 1,1 %A A302275 _R. H. Hardin_, Apr 04 2018