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 A279705 #8 Feb 11 2019 14:25:45 %S A279705 2,4,22,125,717,4121,23690,136181,782826,4500021,25868076,148700951, %T A279705 854797731,4913749086,28246366671,162372399730,933387168180, %U A279705 5365515365948,30843315747327,177300792451846,1019202061854748 %N A279705 Number of n X 4 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. %H A279705 R. H. Hardin, <a href="/A279705/b279705.txt">Table of n, a(n) for n = 1..210</a> %F A279705 Empirical: a(n) = 10*a(n-1) - 33*a(n-2) + 61*a(n-3) - 78*a(n-4) + 64*a(n-5) - 32*a(n-6) + 9*a(n-7) - a(n-8) for n>9. %F A279705 Empirical g.f.: x*(2 - 16*x + 48*x^2 - 85*x^3 + 105*x^4 - 82*x^5 + 40*x^6 - 11*x^7 + x^8) / (1 - 10*x + 33*x^2 - 61*x^3 + 78*x^4 - 64*x^5 + 32*x^6 - 9*x^7 + x^8). - _Colin Barker_, Feb 11 2019 %e A279705 Some solutions for n=4: %e A279705 ..0..1..0..1. .0..1..0..1. .0..1..0..0. .0..1..0..1. .0..1..0..1 %e A279705 ..1..0..1..1. .0..0..1..1. .0..1..1..0. .1..0..0..1. .0..0..1..1 %e A279705 ..1..0..0..1. .1..0..0..0. .0..0..1..1. .1..1..0..1. .1..0..0..1 %e A279705 ..1..0..1..0. .0..1..1..0. .0..1..0..1. .0..1..0..1. .0..1..0..1 %Y A279705 Column 4 of A279709. %K A279705 nonn %O A279705 1,1 %A A279705 _R. H. Hardin_, Dec 17 2016