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 A283039 #7 Sep 03 2025 15:15:40 %S A283039 5,256,5065,94368,1604067,26180826,414085368,6406597648,97480211225, %T A283039 1463896864692,21753273510360,320461563276470,4686814034042643, %U A283039 68124911104620870,984999389958209910,14176505420268232960,203212970311422645415,2902589960282552892838,41327736536350218694304 %N A283039 Number of n X 5 0..1 arrays with no 1 equal to more than one of its horizontal and vertical neighbors, with the exception of exactly one element. %H A283039 R. H. Hardin, <a href="/A283039/b283039.txt">Table of n, a(n) for n = 1..210</a> %H A283039 R. H. Hardin, <a href="/A283039/a283039.txt">Empirical recurrence of order 72</a> %F A283039 Empirical recurrence of order 72 (see link above). %e A283039 Some solutions for n=4: %e A283039 ..0..0..0..1..0. .0..1..0..0..1. .1..0..1..1..0. .0..0..1..0..1 %e A283039 ..0..0..1..0..0. .0..0..0..0..0. .1..0..0..0..1. .1..0..0..0..1 %e A283039 ..0..1..0..0..1. .1..0..0..1..1. .1..0..0..0..0. .0..0..0..1..0 %e A283039 ..0..1..1..0..0. .0..0..0..0..1. .0..0..0..0..1. .0..1..0..1..1 %Y A283039 Column 5 of A283042. %K A283039 nonn,changed %O A283039 1,1 %A A283039 _R. H. Hardin_, Feb 27 2017