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.

A220381 Majority value maps: number of n X 3 binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and antidiagonal neighbors in a random 0..1 n X 3 array.

This page as a plain text file.
%I A220381 #7 Jul 31 2018 08:53:34
%S A220381 4,25,136,753,4160,22989,127037,702009,3879313,21437148,118462034,
%T A220381 654623158,3617458391,19990134860,110465815644,610435923087,
%U A220381 3373279000591,18640795512630,103009344107857,569231338133692
%N A220381 Majority value maps: number of n X 3 binary arrays indicating the locations of corresponding elements equal to at least half of their horizontal and antidiagonal neighbors in a random 0..1 n X 3 array.
%C A220381 Column 3 of A220386.
%H A220381 R. H. Hardin, <a href="/A220381/b220381.txt">Table of n, a(n) for n = 1..210</a>
%F A220381 Empirical: a(n) = 4*a(n-1) + 8*a(n-2) + 3*a(n-3) - 3*a(n-4) - 2*a(n-5).
%F A220381 Empirical g.f.: x*(4 + 9*x + 4*x^2 - 3*x^3 - 3*x^4) / (1 - 4*x - 8*x^2 - 3*x^3 + 3*x^4 + 2*x^5). - _Colin Barker_, Jul 31 2018
%e A220381 Some solutions for n=3:
%e A220381 ..0..0..1....0..0..1....0..0..1....1..1..1....0..0..1....1..1..1....1..1..0
%e A220381 ..0..1..0....0..1..1....1..1..0....1..1..1....0..1..1....1..0..0....1..0..0
%e A220381 ..1..0..0....1..1..0....0..0..1....1..0..0....0..1..1....0..0..1....0..0..0
%Y A220381 Cf. A220386.
%K A220381 nonn
%O A220381 1,1
%A A220381 _R. H. Hardin_, Dec 13 2012