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 A281203 #8 Feb 17 2019 16:54:16 %S A281203 10,94,310,804,1906,4248,9118,19026,38916,78356,155834,306840,599204, %T A281203 1162074,2240438,4297644,8207494,15613762,29601530,55948952,105457480, %U A281203 198283598,371980528,696408816,1301351164,2427600480,4521378510 %N A281203 Number of n X 6 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 A281203 R. H. Hardin, <a href="/A281203/b281203.txt">Table of n, a(n) for n = 1..210</a> %F A281203 Empirical: a(n) = 2*a(n-1) + 3*a(n-2) - 4*a(n-3) - 6*a(n-4) + 4*a(n-6) + 6*a(n-7) + 3*a(n-8) - 2*a(n-9) - 3*a(n-10) - 2*a(n-11) - a(n-12). %F A281203 Empirical g.f.: 2*x*(1 + x)*(5 + 32*x + 14*x^2 - 43*x^3 - 55*x^4 - 31*x^5 + x^6 + 28*x^7 + 24*x^8 + 10*x^9 + 3*x^10) / (1 - x - 2*x^2 + x^4 + x^5 + x^6)^2. - _Colin Barker_, Feb 17 2019 %e A281203 Some solutions for n=4: %e A281203 ..0..1..0..0..1..0. .0..0..1..0..1..0. .0..1..0..1..0..0. .0..0..1..0..1..0 %e A281203 ..0..1..1..0..1..0. .1..0..1..0..1..1. .1..0..1..0..1..0. .1..0..1..0..1..0 %e A281203 ..1..0..1..0..1..0. .0..1..0..1..0..1. .1..0..1..0..1..0. .1..0..1..0..1..0 %e A281203 ..0..1..0..1..0..1. .0..1..0..1..0..1. .1..0..1..0..1..0. .1..0..1..0..0..0 %Y A281203 Column 6 of A281205. %K A281203 nonn %O A281203 1,1 %A A281203 _R. H. Hardin_, Jan 17 2017