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 A297300 #7 Feb 26 2019 12:06:01 %S A297300 1,1,3,5,9,17,32,60,113,213,401,755,1422,2678,5043,9497,17885,33681, %T A297300 63428,119448,224945,423617,797757,1502339,2829210,5327978,10033667, %U A297300 18895437,35583953,67011825,126196904,237654452,447551697,842830925 %N A297300 Number of 3 X n 0..1 arrays with every 1 horizontally or antidiagonally adjacent to 2 neighboring 1s. %H A297300 R. H. Hardin, <a href="/A297300/b297300.txt">Table of n, a(n) for n = 1..210</a> %F A297300 Empirical: a(n) = 2*a(n-1) - a(n-2) + 2*a(n-3) - a(n-4) for n>6. %F A297300 Empirical g.f.: x*(1 - x)*(1 + x^2)^2 / (1 - 2*x + x^2 - 2*x^3 + x^4). - _Colin Barker_, Feb 26 2019 %e A297300 Some solutions for n=5: %e A297300 ..0..1..1..0..0. .0..0..0..0..0. .0..0..0..0..0. .0..1..1..0..0 %e A297300 ..1..1..0..1..1. .0..0..1..1..0. .0..0..0..0..0. .1..1..0..0..0 %e A297300 ..0..0..1..1..0. .0..1..1..0..0. .0..0..0..0..0. .0..0..0..0..0 %Y A297300 Row 3 of A297299. %K A297300 nonn %O A297300 1,3 %A A297300 _R. H. Hardin_, Dec 27 2017