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.

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

This page as a plain text file.
%I A219411 #8 Jul 26 2018 05:16:59
%S A219411 1,7,28,98,351,1261,4523,16233,58268,209132,750597,2693993,9669101,
%T A219411 34703683,124556124,447048462,1604516243,5758821685,20669175143,
%U A219411 74184412085,266257698140,955634207080,3429897967721,12310358902801
%N A219411 Unmatched value maps: number of 2 X n binary arrays indicating the locations of corresponding elements not equal to any horizontal or antidiagonal neighbor in a random 0..2 2 X n array.
%C A219411 Row 2 of A219410.
%H A219411 R. H. Hardin, <a href="/A219411/b219411.txt">Table of n, a(n) for n = 1..210</a>
%F A219411 Empirical: a(n) = 4*a(n-1) - 3*a(n-2) + 6*a(n-3) - 3*a(n-4) + 4*a(n-5).
%F A219411 Empirical g.f.: x*(1 + 3*x + 3*x^2 + x^3 + 4*x^4) / ((1 - x + x^2)*(1 - 3*x - x^2 - 4*x^3)). - _Colin Barker_, Jul 26 2018
%e A219411 Some solutions for n=3:
%e A219411 ..0..0..1....0..0..1....0..0..0....0..0..0....0..0..0....1..0..0....1..1..1
%e A219411 ..1..1..1....1..0..0....0..0..0....1..0..0....1..0..1....0..0..1....1..0..0
%Y A219411 Cf. A219410.
%K A219411 nonn
%O A219411 1,2
%A A219411 _R. H. Hardin_, Nov 19 2012