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 A281201 #9 Feb 16 2019 12:25:00 %S A281201 2,28,98,270,676,1588,3604,7960,17254,36848,77776,162610,337292, %T A281201 694982,1423852,2902806,5892558,11916410,24017514,48262212,96719706, %U A281201 193358890,385702166,767826768,1525708160,3026506470,5994196442,11854696726 %N A281201 Number of n X 4 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. %H A281201 R. H. Hardin, <a href="/A281201/b281201.txt">Table of n, a(n) for n = 1..210</a> %F A281201 Empirical: a(n) = 2*a(n-1) + 3*a(n-2) - 4*a(n-3) - 6*a(n-4) + 2*a(n-5) + 4*a(n-6) - a(n-8). %F A281201 Empirical g.f.: 2*x*(1 + x)*(1 + 11*x + 7*x^2 - 8*x^3 - 9*x^4 + 2*x^6) / (1 - x - 2*x^2 + x^4)^2. - _Colin Barker_, Feb 16 2019 %e A281201 Some solutions for n=4: %e A281201 ..0..0..1..0. .0..0..1..1. .0..0..1..1. .0..1..0..1. .0..1..0..1 %e A281201 ..1..0..1..1. .1..0..0..1. .1..0..0..0. .0..1..1..0. .0..1..0..1 %e A281201 ..1..0..0..0. .1..1..0..1. .1..0..1..0. .0..0..1..0. .1..0..1..0 %e A281201 ..1..0..1..1. .0..1..1..1. .1..0..1..0. .1..0..1..1. .1..0..0..0 %Y A281201 Column 4 of A281205. %K A281201 nonn %O A281201 1,1 %A A281201 _R. H. Hardin_, Jan 17 2017