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.

A279264 Number of nX4 0..1 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.

This page as a plain text file.
%I A279264 #4 Dec 08 2016 21:04:17
%S A279264 2,20,86,400,1592,5888,21882,79112,281754,991292,3452756,11929580,
%T A279264 40936072,139644508,473965068,1601601800,5391122062,18084715096,
%U A279264 60480149694,201706042464,671036424848,2227380695220,7378205313096
%N A279264 Number of nX4 0..1 arrays with no element equal to a strict majority of its horizontal and vertical neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.
%C A279264 Column 4 of A279268.
%H A279264 R. H. Hardin, <a href="/A279264/b279264.txt">Table of n, a(n) for n = 1..210</a>
%F A279264 Empirical: a(n) = 10*a(n-1) -37*a(n-2) +62*a(n-3) -44*a(n-4) -16*a(n-5) +109*a(n-6) -148*a(n-7) +111*a(n-8) -290*a(n-9) +399*a(n-10) -144*a(n-11) -90*a(n-12) +622*a(n-13) -605*a(n-14) +60*a(n-15) -696*a(n-16) +776*a(n-17) -6*a(n-18) -230*a(n-19) +395*a(n-20) -290*a(n-21) +80*a(n-22) +4*a(n-23) -50*a(n-24) +28*a(n-25) -16*a(n-26) +4*a(n-27) -a(n-28) for n>31
%e A279264 Some solutions for n=4
%e A279264 ..0..1..1..0. .0..0..0..1. .0..1..0..0. .0..0..1..1. .0..0..1..1
%e A279264 ..1..0..0..1. .1..0..1..0. .0..1..1..0. .1..1..0..0. .1..1..0..0
%e A279264 ..0..1..1..0. .1..0..1..1. .1..0..0..1. .0..1..1..0. .0..1..0..1
%e A279264 ..0..0..1..0. .0..1..0..0. .0..1..0..1. .1..0..0..1. .1..1..1..0
%Y A279264 Cf. A279268.
%K A279264 nonn
%O A279264 1,1
%A A279264 _R. H. Hardin_, Dec 08 2016