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 A281712 #4 Jan 28 2017 13:43:18 %S A281712 3,29,90,294,937,3166,10738,37285,129586,452042,1578499,5515546, %T A281712 19279612,67403955,235679364,824104430,2881741245,10077105830, %U A281712 35238715476,123227200603,430917662802,1506893871278,5269524537393,18427245321410 %N A281712 Number of nX5 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors and with new values introduced in order 0 sequentially upwards. %C A281712 Column 5 of A281715. %H A281712 R. H. Hardin, <a href="/A281712/b281712.txt">Table of n, a(n) for n = 1..210</a> %F A281712 Empirical: a(n) = 5*a(n-1) -2*a(n-2) -9*a(n-3) -17*a(n-4) +18*a(n-5) +45*a(n-6) +5*a(n-7) -46*a(n-8) -14*a(n-9) +102*a(n-10) -101*a(n-11) +167*a(n-12) -132*a(n-13) -151*a(n-14) +2*a(n-15) -214*a(n-16) +40*a(n-17) -115*a(n-18) -55*a(n-19) -37*a(n-20) -17*a(n-21) -2*a(n-22) -15*a(n-23) +4*a(n-24) for n>28 %e A281712 Some solutions for n=4 %e A281712 ..0..1..0..0..0. .0..0..0..1..1. .0..0..0..0..0. .0..0..1..1..1 %e A281712 ..1..0..1..1..1. .0..0..1..1..1. .0..0..0..1..1. .0..0..1..1..1 %e A281712 ..0..1..1..1..1. .0..1..0..1..1. .1..1..1..1..1. .0..1..1..1..1 %e A281712 ..0..0..1..1..1. .1..0..1..0..0. .1..1..1..1..1. .0..0..1..1..1 %Y A281712 Cf. A281715. %K A281712 nonn %O A281712 1,1 %A A281712 _R. H. Hardin_, Jan 28 2017