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 A297685 #4 Jan 03 2018 09:31:57 %S A297685 32,291,3744,34872,401678,4202440,45865837,488402012,5277134441, %T A297685 56590184544,609118876500,6543424122789,70369098323857, %U A297685 756319883731372,8131309593772974,87407051279518533,939657110269352989 %N A297685 Number of 5Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 1 or 4 neighboring 1s. %C A297685 Row 5 of A297682. %H A297685 R. H. Hardin, <a href="/A297685/b297685.txt">Table of n, a(n) for n = 1..210</a> %F A297685 Empirical: a(n) = 4*a(n-1) +45*a(n-2) +198*a(n-3) +1120*a(n-4) -571*a(n-5) +949*a(n-6) -25951*a(n-7) +43907*a(n-8) -121981*a(n-9) +237707*a(n-10) -305033*a(n-11) +951497*a(n-12) -2179565*a(n-13) +1393985*a(n-14) +38155*a(n-15) +856624*a(n-16) +1417955*a(n-17) -2925138*a(n-18) +4386425*a(n-19) -3349236*a(n-20) +7904975*a(n-21) -936917*a(n-22) +6331851*a(n-23) -431305*a(n-24) -2123285*a(n-25) -1887476*a(n-26) -6000225*a(n-27) -5171754*a(n-28) -5025966*a(n-29) -3580724*a(n-30) +728778*a(n-31) +1200558*a(n-32) +668712*a(n-33) +511075*a(n-34) +1377776*a(n-35) +458144*a(n-36) +151448*a(n-37) -54584*a(n-38) -42912*a(n-39) -30464*a(n-40) +3840*a(n-41) %e A297685 Some solutions for n=4 %e A297685 ..0..1..1..1. .0..1..0..0. .1..0..0..0. .1..0..0..1. .1..0..0..0 %e A297685 ..0..1..0..1. .0..0..0..0. .1..0..0..0. .0..1..0..0. .0..1..0..1 %e A297685 ..0..1..0..0. .0..0..1..0. .0..0..0..0. .0..0..0..0. .0..1..0..1 %e A297685 ..1..0..0..1. .0..0..0..0. .1..0..0..0. .0..1..0..0. .0..1..0..1 %e A297685 ..1..0..0..0. .1..0..1..1. .0..1..0..1. .0..0..0..0. .0..1..1..1 %Y A297685 Cf. A297682. %K A297685 nonn %O A297685 1,1 %A A297685 _R. H. Hardin_, Jan 03 2018