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 A297591 #25 Mar 05 2019 14:26:02 %S A297591 1,4,13,49,154,577,1977,6962,24441,85803,300758,1056231,3705161, %T A297591 13002296,45626359,160104845,561810578,1971441799,6917860901, %U A297591 24275155066,85182802525,298910850927,1048893665520,3680622917741,12915496721997,45321151308320,159034280809195 %N A297591 Number of n X 4 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 5 neighboring 1s. %H A297591 Alois P. Heinz, <a href="/A297591/b297591.txt">Table of n, a(n) for n = 0..1000</a> (terms n = 1..210 from R. H. Hardin) %F A297591 Empirical: a(n) = a(n-1) + 6*a(n-2) + 10*a(n-3) + 3*a(n-4) - 13*a(n-5) + 3*a(n-6) - 3*a(n-7) - 4*a(n-8) - a(n-9). %F A297591 Empirical g.f.: 1 + x*(4 + 9*x + 12*x^2 - 13*x^3 - 13*x^4 - x^5 - 7*x^6 - 5*x^7 - x^8) / (1 - x - 6*x^2 - 10*x^3 - 3*x^4 + 13*x^5 - 3*x^6 + 3*x^7 + 4*x^8 + x^9). - _Colin Barker_, Mar 01 2019 %e A297591 Some solutions for n=7: %e A297591 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 %e A297591 0 1 0 0 0 1 0 1 0 1 0 0 0 1 1 0 0 0 1 0 %e A297591 0 0 1 0 0 1 1 1 0 1 0 0 0 0 0 0 0 0 1 0 %e A297591 0 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 0 1 0 0 %e A297591 0 0 0 0 0 0 0 0 1 0 1 0 0 0 1 0 0 1 0 0 %e A297591 0 0 1 1 0 0 0 1 0 1 1 0 1 1 1 0 1 0 0 1 %e A297591 0 0 0 0 0 0 1 0 1 0 1 0 1 0 1 0 0 0 1 0 %Y A297591 Column 4 of A297595. %K A297591 nonn %O A297591 0,2 %A A297591 _R. H. Hardin_, Jan 01 2018 %E A297591 a(0)=1 prepended by _Alois P. Heinz_, Mar 01 2019