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.

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

This page as a plain text file.
%I A219004 #8 Jul 25 2018 05:20:30
%S A219004 1,36,328,2265,16648,127401,966981,7298225,55135016,416848560,
%T A219004 3151246505,23819866072,180053403609,1361036722345,10288162925081,
%U A219004 77768717139628,587857527338664,4443644969933825,33589738253657200,253906529656115169
%N A219004 Unmatched value maps: number of 3 X n binary arrays indicating the locations of corresponding elements not equal to any horizontal, diagonal or antidiagonal neighbor in a random 0..2 3 X n array.
%C A219004 Row 3 of A219002.
%H A219004 R. H. Hardin, <a href="/A219004/b219004.txt">Table of n, a(n) for n = 1..42</a>
%F A219004 Empirical: a(n) = 7*a(n-1) - 3*a(n-2) + 49*a(n-3) + 45*a(n-4) - 17*a(n-5) - 15*a(n-6).
%F A219004 Empirical g.f.: x*(1 + 29*x + 79*x^2 + 28*x^3 - 32*x^4 - 15*x^5) / (1 - 7*x + 3*x^2 - 49*x^3 - 45*x^4 + 17*x^5 + 15*x^6). - _Colin Barker_, Jul 25 2018
%e A219004 Some solutions for n=3:
%e A219004 ..1..1..0....0..0..1....0..1..0....1..1..1....0..0..1....1..1..0....0..0..0
%e A219004 ..0..0..1....0..1..1....0..0..0....1..0..0....1..0..0....1..0..1....1..1..1
%e A219004 ..1..1..0....1..0..0....0..0..0....1..1..1....1..0..0....0..1..0....1..1..1
%Y A219004 Cf. A219002.
%K A219004 nonn
%O A219004 1,2
%A A219004 _R. H. Hardin_, Nov 09 2012