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 A297398 #4 Dec 29 2017 10:59:39 %S A297398 1,41,139,385,3175,14940,58901,325922,1616869,7303419,36440971, %T A297398 179690470,852213260,4150469302,20279868193,97720833639,473767953000, %U A297398 2303837003374,11153405540217,54053378441391,262342164214663,1271623035196752 %N A297398 Number of 5Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 neighboring 1. %C A297398 Row 5 of A297395. %H A297398 R. H. Hardin, <a href="/A297398/b297398.txt">Table of n, a(n) for n = 1..210</a> %F A297398 Empirical: a(n) = a(n-1) +4*a(n-2) +69*a(n-3) +50*a(n-4) -a(n-5) -785*a(n-6) -696*a(n-7) -757*a(n-8) +2847*a(n-9) +1739*a(n-10) +270*a(n-11) -1916*a(n-12) -1560*a(n-13) -932*a(n-14) +1326*a(n-15) +652*a(n-16) +140*a(n-17) -373*a(n-18) -14*a(n-19) -28*a(n-20) +30*a(n-21) %e A297398 Some solutions for n=5 %e A297398 ..0..1..1..0..0. .0..0..0..1..1. .0..0..1..0..0. .1..1..0..0..0 %e A297398 ..0..0..0..0..0. .1..1..0..0..0. .1..0..0..1..0. .0..0..0..1..0 %e A297398 ..1..0..0..0..0. .0..0..0..0..0. .0..1..0..0..0. .1..1..0..0..1 %e A297398 ..0..1..0..1..0. .0..0..0..0..0. .0..0..0..1..1. .0..0..0..0..0 %e A297398 ..0..0..0..0..1. .0..0..0..1..1. .0..0..0..0..0. .0..0..0..1..1 %Y A297398 Cf. A297395. %K A297398 nonn %O A297398 1,2 %A A297398 _R. H. Hardin_, Dec 29 2017