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.

A279710 Number of 3 X n 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.

This page as a plain text file.
%I A279710 #8 Feb 11 2019 14:23:22
%S A279710 4,5,11,22,47,102,224,494,1089,2400,5289,11661,25718,56728,125125,
%T A279710 275973,608663,1342423,2960792,6530255,14402991,31766847,70063951,
%U A279710 154530760,340828154,751720173,1657971361,3656771426,8065263401,17788497730
%N A279710 Number of 3 X n 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 A279710 R. H. Hardin, <a href="/A279710/b279710.txt">Table of n, a(n) for n = 1..210</a>
%F A279710 Empirical: a(n) = 3*a(n-1) - 2*a(n-2) - a(n-3) + 4*a(n-4) - a(n-5) - a(n-7) - a(n-8).
%F A279710 Empirical g.f.: x*(4 - 7*x + 4*x^2 + 3*x^3 - 8*x^4 - 5*x^6) / ((1 - x)*(1 + x)*(1 - 2*x - x^3)*(1 - x + x^2 + x^3)). - _Colin Barker_, Feb 11 2019
%e A279710 Some solutions for n=4:
%e A279710 ..0..1..0..1. .0..1..0..1. .0..1..1..0. .0..1..1..0. .0..1..0..1
%e A279710 ..0..1..0..0. .0..1..1..0. .0..0..0..1. .0..0..1..0. .1..0..1..0
%e A279710 ..0..1..1..0. .0..0..1..0. .1..1..0..1. .0..1..0..1. .1..0..1..0
%Y A279710 Row 3 of A279709.
%K A279710 nonn
%O A279710 1,1
%A A279710 _R. H. Hardin_, Dec 17 2016