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 A280437 #7 Feb 13 2019 10:01:15 %S A280437 5,38,77,138,225,360,574,920,1487,2422,3971,6542,10814,17914,29713, %T A280437 49314,81861,135876,225470,373996,620083,1027598,1702087,2817898, %U A280437 4662910,7712270,12749909,21068730,34800297,57457632,94828606,156445952 %N A280437 Number of n X 5 0..1 arrays with no element equal to more than one of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. %H A280437 R. H. Hardin, <a href="/A280437/b280437.txt">Table of n, a(n) for n = 1..210</a> %F A280437 Empirical: a(n) = 4*a(n-1) - 4*a(n-2) - 2*a(n-3) + 4*a(n-4) - a(n-6) for n>7. %F A280437 Empirical g.f.: x*(5 + 18*x - 55*x^2 - 8*x^3 + 37*x^4 + 14*x^5 + 7*x^6) / ((1 - x)^2*(1 - x - x^2)^2). - _Colin Barker_, Feb 13 2019 %e A280437 Some solutions for n=4: %e A280437 ..0..1..1..0..0. .0..0..1..0..0. .0..1..0..1..1. .0..1..0..1..0 %e A280437 ..1..0..0..1..0. .1..1..0..1..0. .1..0..1..0..0. .1..0..1..0..1 %e A280437 ..0..1..1..0..1. .0..0..1..0..1. .1..0..0..1..1. .0..1..0..0..1 %e A280437 ..1..0..0..1..0. .1..1..0..1..0. .0..1..1..0..0. .1..0..1..1..0 %Y A280437 Column 5 of A280440. %K A280437 nonn %O A280437 1,1 %A A280437 _R. H. Hardin_, Jan 03 2017