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 A296536 #8 Feb 23 2019 07:23:47 %S A296536 1,5,16,37,96,254,654,1709,4472,11621,30257,78899,205534,535394, %T A296536 1395017,3634476,9468722,24669483,64272370,167449745,436262198, %U A296536 1136608103,2961236309,7714995835,20100110050,52367403411,136434332477,355456392933 %N A296536 Number of n X 3 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 2 or 4 neighboring 1s. %H A296536 R. H. Hardin, <a href="/A296536/b296536.txt">Table of n, a(n) for n = 1..210</a> %F A296536 Empirical: a(n) = 2*a(n-1) - a(n-2) + 5*a(n-3) + a(n-4) + 6*a(n-5) + 7*a(n-6) + a(n-7) + 3*a(n-8) + 3*a(n-9) - 3*a(n-10) - 4*a(n-11) - a(n-12). %F A296536 Empirical g.f.: x*(1 + 3*x + 7*x^2 + 5*x^3 + 12*x^4 + 8*x^5 + 4*x^6 + 6*x^7 - 7*x^9 - 5*x^10 - x^11) / ((1 + x^2 + x^3)*(1 - 2*x - 4*x^3 + x^4 - 2*x^5 - 4*x^6 + 3*x^8 + x^9)). - _Colin Barker_, Feb 23 2019 %e A296536 Some solutions for n=7: %e A296536 ..0..1..1. .1..1..0. .0..0..0. .0..1..0. .0..0..0. .0..0..1. .0..1..0 %e A296536 ..0..1..0. .1..0..0. .1..1..0. .1..1..1. .1..1..0. .1..1..1. .1..1..1 %e A296536 ..0..0..0. .0..0..1. .1..0..0. .0..1..0. .1..0..0. .1..0..0. .0..1..0 %e A296536 ..1..1..0. .0..1..1. .0..0..1. .1..1..0. .0..0..0. .0..1..1. .1..1..0 %e A296536 ..1..0..0. .0..0..0. .0..1..1. .0..0..0. .1..1..0. .0..1..0. .0..0..1 %e A296536 ..0..1..0. .1..1..0. .0..0..0. .0..0..0. .1..0..0. .1..1..0. .1..1..1 %e A296536 ..1..1..0. .1..0..0. .0..0..0. .0..0..0. .0..0..0. .0..0..0. .1..0..0 %Y A296536 Column 3 of A296541. %K A296536 nonn %O A296536 1,2 %A A296536 _R. H. Hardin_, Dec 15 2017