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.

A219003 Unmatched value maps: number of 2 X n binary arrays indicating the locations of corresponding elements not equal to any horizontal, diagonal or antidiagonal neighbor in a random 0..2 2 X n array.

This page as a plain text file.
%I A219003 #8 Jul 25 2018 03:46:50
%S A219003 1,10,46,163,604,2341,9019,34489,131968,505576,1936801,7418188,
%T A219003 28412533,108826777,416833201,1596565270,6115202470,23422612879,
%U A219003 89713931536,343624709737,1316160560251,5041193495617,19308914689348,73957523312800
%N A219003 Unmatched value maps: number of 2 X n binary arrays indicating the locations of corresponding elements not equal to any horizontal, diagonal or antidiagonal neighbor in a random 0..2 2 X n array.
%C A219003 Row 2 of A219002.
%H A219003 R. H. Hardin, <a href="/A219003/b219003.txt">Table of n, a(n) for n = 1..210</a>
%F A219003 Empirical: a(n) = 4*a(n-1) - 3*a(n-2) + 9*a(n-3).
%F A219003 Empirical g.f.: x*(1 + 3*x)^2 / (1 - 4*x + 3*x^2 - 9*x^3). - _Colin Barker_, Jul 25 2018
%e A219003 Some solutions for n=3:
%e A219003 ..1..0..0....1..0..1....1..0..1....1..1..0....0..1..0....0..0..1....0..1..1
%e A219003 ..1..1..1....0..1..0....0..0..1....1..0..1....1..0..0....0..1..1....0..0..1
%Y A219003 Cf. A219002.
%K A219003 nonn
%O A219003 1,2
%A A219003 _R. H. Hardin_, Nov 09 2012