cp's OEIS Frontend

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.

A281803 Number of 2 X n 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.

This page as a plain text file.
%I A281803 #6 Aug 19 2022 13:59:18
%S A281803 0,0,6,38,157,524,1631,4694,13006,34776,90703,231788,582557,1444328,
%T A281803 3539638,8590070,20670737,49377196,117193443,276578138,649454590,
%U A281803 1518211492,3534848915,8200472092,18962152697,43716887564,100516988278
%N A281803 Number of 2 X n 0..1 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with the exception of exactly two elements, and with new values introduced in order 0 sequentially upwards.
%C A281803 Row 2 of A281802.
%H A281803 R. H. Hardin, <a href="/A281803/b281803.txt">Table of n, a(n) for n = 1..210</a>
%F A281803 Empirical: a(n) = 7*a(n-1) -10*a(n-2) -29*a(n-3) +68*a(n-4) +67*a(n-5) -195*a(n-6) -108*a(n-7) +306*a(n-8) +132*a(n-9) -276*a(n-10) -96*a(n-11) +136*a(n-12) +32*a(n-13) -32*a(n-14).
%e A281803 Some solutions for n=4
%e A281803 ..0..1..1..1. .0..0..0..0. .0..1..0..1. .0..1..0..0. .0..0..1..0
%e A281803 ..1..1..1..0. .1..1..0..1. .1..1..1..1. .0..0..1..0. .1..1..1..1
%Y A281803 Cf. A281802.
%K A281803 nonn
%O A281803 1,3
%A A281803 _R. H. Hardin_, Jan 30 2017