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 A297545 #7 Mar 22 2018 09:47:50 %S A297545 1,2,11,24,38,105,381,1067,2676,7533,22732,65556,183281,521969, %T A297545 1510877,4344326,12399075,35475604,101864678,292266497,837202865, %U A297545 2398735503,6877922768,19720368509,56523514608,162009389860,464424317089 %N A297545 Number of 2 X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2 or 3 neighboring 1s. %C A297545 Row 2 of A297544. %H A297545 R. H. Hardin, <a href="/A297545/b297545.txt">Table of n, a(n) for n = 1..210</a> %F A297545 Empirical: a(n) = 3*a(n-1) - 2*a(n-2) + 5*a(n-3) + 6*a(n-4) - 16*a(n-5) - 12*a(n-6). %F A297545 Empirical g.f.: x*(1 - x + 7*x^2 - 10*x^3 - 28*x^4 - 12*x^5) / (1 - 3*x + 2*x^2 - 5*x^3 - 6*x^4 + 16*x^5 + 12*x^6). - _Colin Barker_, Mar 22 2018 %e A297545 Some solutions for n=5: %e A297545 ..0..1..1..1..0. .0..0..1..1..0. .0..1..1..1..0. .0..0..0..1..1 %e A297545 ..0..0..1..1..1. .0..0..1..1..1. .0..1..1..0..0. .0..0..1..1..0 %Y A297545 Cf. A297544. %K A297545 nonn %O A297545 1,2 %A A297545 _R. H. Hardin_, Dec 31 2017