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 A280857 #4 Jan 09 2017 09:36:38 %S A280857 82,1708,678,462,491,712,1202,2268,4220,7108,11240,17330,26934,43062, %T A280857 70776,117452,193842,316394,511776,825074,1333130,2163076,3521462, %U A280857 5738446,9343090,15187700,24659768,40027188,64994524,105599072,171639520 %N A280857 Number of nX6 0..2 arrays with no element equal to more than one of its king-move neighbors and with new values introduced in order 0 sequentially upwards. %C A280857 Column 6 of A280859. %H A280857 R. H. Hardin, <a href="/A280857/b280857.txt">Table of n, a(n) for n = 1..210</a> %F A280857 Empirical: a(n) = a(n-1) +a(n-2) -a(n-3) +a(n-4) +6*a(n-7) -5*a(n-8) +3*a(n-9) -3*a(n-10) -3*a(n-11) +2*a(n-12) -4*a(n-13) +a(n-14) -2*a(n-15) -2*a(n-16) for n>22 %e A280857 Some solutions for n=4 %e A280857 ..0..1..1..2..2..1. .0..1..0..1..1..2. .0..1..0..1..0..1. .0..0..1..2..2..0 %e A280857 ..0..2..0..0..1..0. .1..2..0..2..0..0. .2..1..2..1..2..2. .1..2..1..0..1..0 %e A280857 ..1..2..1..2..2..0. .0..2..1..2..1..2. .2..0..2..0..0..1. .1..0..2..0..2..1 %e A280857 ..1..0..1..0..1..1. .1..0..1..0..1..0. .1..0..1..1..2..2. .2..0..1..1..2..0 %Y A280857 Cf. A280859. %K A280857 nonn %O A280857 1,1 %A A280857 _R. H. Hardin_, Jan 09 2017