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.

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

This page as a plain text file.
%I A219405 #8 Jul 26 2018 05:16:45
%S A219405 4,28,181,1180,7687,50077,326233,2125270,13845268,90196219,587591326,
%T A219405 3827916001,24937299865,162456261409,1058335787620,6894622770400,
%U A219405 44915634248581,292606900638904,1906213721217931,12418199102692513
%N A219405 Unmatched value maps: number of n X 3 binary arrays indicating the locations of corresponding elements not equal to any horizontal or antidiagonal neighbor in a random 0..2 n X 3 array.
%C A219405 Column 3 of A219410.
%H A219405 R. H. Hardin, <a href="/A219405/b219405.txt">Table of n, a(n) for n = 1..210</a>
%F A219405 Empirical: a(n) = 4*a(n-1) + 15*a(n-2) + 9*a(n-3).
%F A219405 Empirical g.f.: x*(2 + 3*x)^2 / (1 - 4*x - 15*x^2 - 9*x^3). - _Colin Barker_, Jul 26 2018
%e A219405 Some solutions for n=3:
%e A219405 ..1..0..0....1..0..0....1..0..0....0..0..1....1..0..1....1..1..1....0..0..0
%e A219405 ..1..0..1....1..1..0....1..0..1....0..1..0....0..0..0....1..1..1....0..0..0
%e A219405 ..0..0..0....0..0..0....1..1..1....0..0..1....1..0..0....1..1..1....0..1..1
%Y A219405 Cf. A219410.
%K A219405 nonn
%O A219405 1,1
%A A219405 _R. H. Hardin_, Nov 19 2012