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 A297650 #4 Jan 02 2018 15:06:30 %S A297650 7,140,1073,11024,113252,1105531,11089103,110654243,1101808354, %T A297650 10993719747,109616866972,1092971987768,10899244123139, %U A297650 108681241877689,1083722571101531,10806476047854350,107757578616646017 %N A297650 Number of nX4 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1, 2 or 3 neighboring 1s. %C A297650 Column 4 of A297654. %H A297650 R. H. Hardin, <a href="/A297650/b297650.txt">Table of n, a(n) for n = 1..210</a> %F A297650 Empirical: a(n) = 5*a(n-1) +33*a(n-2) +181*a(n-3) -86*a(n-4) -424*a(n-5) -2573*a(n-6) -2524*a(n-7) +335*a(n-8) +9815*a(n-9) +13091*a(n-10) -1385*a(n-11) -21743*a(n-12) -13896*a(n-13) +13557*a(n-14) +25034*a(n-15) +5697*a(n-16) -9754*a(n-17) -8120*a(n-18) +452*a(n-19) +2280*a(n-20) +1082*a(n-21) +210*a(n-22) -30*a(n-23) -12*a(n-24) %e A297650 Some solutions for n=5 %e A297650 ..0..0..0..0. .0..1..1..0. .0..0..0..0. .0..1..0..0. .1..1..0..0 %e A297650 ..0..0..0..0. .0..0..1..0. .1..1..1..1. .1..1..0..0. .0..0..0..1 %e A297650 ..0..1..1..0. .1..0..1..0. .0..0..0..0. .0..0..1..0. .0..0..1..1 %e A297650 ..1..0..1..0. .0..1..0..1. .1..1..0..0. .0..1..0..0. .1..1..1..0 %e A297650 ..0..1..1..0. .0..1..1..0. .0..0..1..1. .0..1..1..1. .0..0..0..1 %Y A297650 Cf. A297654. %K A297650 nonn %O A297650 1,1 %A A297650 _R. H. Hardin_, Jan 02 2018