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.

A232017 Number of n X 2 0..2 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.

This page as a plain text file.
%I A232017 #7 Oct 01 2018 21:10:12
%S A232017 3,22,121,704,4059,23422,135166,779977,4500958,25973244,149881402,
%T A232017 864906711,4991036946,28801314179,166201073269,959081123649,
%U A232017 5534480515641,31937313562863,184297694197368,1063509616098391
%N A232017 Number of n X 2 0..2 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.
%H A232017 R. H. Hardin, <a href="/A232017/b232017.txt">Table of n, a(n) for n = 1..210</a>
%F A232017 Empirical: a(n) = 3*a(n-1) + 13*a(n-2) + 16*a(n-3) + 7*a(n-4) + a(n-5).
%F A232017 Empirical g.f.: x*(1 + x)*(3 + x)*(1 + 3*x + x^2) / (1 - 3*x - 13*x^2 - 16*x^3 - 7*x^4 - x^5). - _Colin Barker_, Oct 01 2018
%e A232017 Some solutions for n=7:
%e A232017 ..1..1....2..0....1..1....1..1....0..0....0..0....2..0....2..0....1..1....1..0
%e A232017 ..1..0....0..0....0..0....0..0....1..0....0..0....0..1....0..0....1..2....0..1
%e A232017 ..0..1....0..1....2..1....1..2....0..0....1..1....2..2....1..2....0..0....1..1
%e A232017 ..0..0....2..0....0..0....1..1....1..2....2..2....0..0....1..1....1..1....2..0
%e A232017 ..0..1....0..0....0..0....0..0....2..2....2..2....1..1....2..1....2..1....0..1
%e A232017 ..2..0....1..1....0..2....0..0....2..1....1..0....1..0....0..0....1..1....0..0
%e A232017 ..0..1....1..1....2..2....2..2....1..1....0..2....0..2....1..1....1..1....2..2
%Y A232017 Column 2 of A232023.
%K A232017 nonn
%O A232017 1,1
%A A232017 _R. H. Hardin_, Nov 17 2013