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.

A209041 Number of n X 2 0..3 arrays with no element equal the average of immediate neighbors vertically above and horizontally left of it.

This page as a plain text file.
%I A209041 #9 Jul 08 2018 07:56:45
%S A209041 12,124,1300,13644,143212,1503212,15778340,165616044,1738375148,
%T A209041 18246711388,191525101396,2010327432972,21101236121548,
%U A209041 221487384867980,2324824070641124,24402324144347820,256136983080016460
%N A209041 Number of n X 2 0..3 arrays with no element equal the average of immediate neighbors vertically above and horizontally left of it.
%C A209041 Column 2 of A209047.
%H A209041 R. H. Hardin, <a href="/A209041/b209041.txt">Table of n, a(n) for n = 1..210</a>
%F A209041 Empirical: a(n) = 11*a(n-1) - 5*a(n-2) - 3*a(n-3).
%F A209041 Empirical g.f.: 4*x*(1 - x)*(3 + x) / (1 - 11*x + 5*x^2 + 3*x^3). - _Colin Barker_, Jul 08 2018
%e A209041 Some solutions for n=4:
%e A209041 ..3..1....1..0....2..3....1..0....1..2....0..1....0..1....2..3....1..3....2..0
%e A209041 ..1..2....0..1....1..0....2..3....2..3....3..0....1..3....1..0....0..1....1..0
%e A209041 ..3..3....1..3....3..2....1..3....3..0....1..1....3..0....0..3....1..0....2..0
%e A209041 ..0..1....2..2....2..0....3..1....2..0....2..0....0..1....1..0....2..0....1..2
%Y A209041 Cf. A209047.
%K A209041 nonn
%O A209041 1,1
%A A209041 _R. H. Hardin_, Mar 04 2012