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 A280360 #4 Jan 01 2017 08:56:16 %S A280360 30,1617,78800,3992071,201054068,10144351660,511688896140, %T A280360 25812250379197,1302084964081326,65683250595897258, %U A280360 3313367690989159234,167141663155726686922,8431401872254944607810,425319079112261667548370 %N A280360 Number of nX5 0..2 arrays with no element equal to more than one of its horizontal and vertical neighbors and with new values introduced in order 0 sequentially upwards. %C A280360 Column 5 of A280362. %H A280360 R. H. Hardin, <a href="/A280360/b280360.txt">Table of n, a(n) for n = 1..210</a> %e A280360 Some solutions for n=3 %e A280360 ..0..1..0..1..2. .0..1..2..0..0. .0..1..2..1..0. .0..1..2..0..1 %e A280360 ..0..2..2..0..1. .2..0..1..2..1. .2..0..1..2..1. .2..0..1..2..0 %e A280360 ..1..1..0..2..2. .1..0..2..0..0. .1..1..2..0..0. .1..2..1..0..1 %Y A280360 Cf. A280362. %K A280360 nonn %O A280360 1,1 %A A280360 _R. H. Hardin_, Jan 01 2017