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 A281202 #8 Feb 17 2019 16:55:02 %S A281202 5,52,176,470,1141,2602,5712,12208,25577,52784,107636,217370,435473, %T A281202 866550,1714460,3375236,6616061,12919308,25142632,48783294,94395997, %U A281202 182209890,350933080,674521464,1294078657,2478473672,4739410828 %N A281202 Number of n X 5 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 A281202 R. H. Hardin, <a href="/A281202/b281202.txt">Table of n, a(n) for n = 1..210</a> %F A281202 Empirical: a(n) = 4*a(n-1) - 4*a(n-2) - 2*a(n-4) + 4*a(n-5) - a(n-8). %F A281202 Empirical g.f.: x*(5 + 32*x - 12*x^2 - 26*x^3 - 25*x^4 + 2*x^5 + 12*x^6 + 4*x^7) / ((1 - x)^2*(1 - x - x^2 - x^3)^2). - _Colin Barker_, Feb 17 2019 %e A281202 Some solutions for n=4: %e A281202 ..0..1..0..1..0. .0..1..1..0..1. .0..1..0..0..1. .0..1..1..0..1 %e A281202 ..0..0..0..1..0. .0..0..1..0..1. .1..0..1..0..1. .0..1..0..1..0 %e A281202 ..0..1..0..1..0. .1..1..1..0..1. .1..0..1..0..1. .0..1..0..1..1 %e A281202 ..1..0..1..0..1. .1..0..1..0..0. .0..1..0..1..0. .0..1..0..0..1 %Y A281202 Column 5 of A281205. %K A281202 nonn %O A281202 1,1 %A A281202 _R. H. Hardin_, Jan 17 2017