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.

A218839 Unmatched value maps: number of nX5 binary arrays indicating the locations of corresponding elements not equal to any horizontal or antidiagonal neighbor in a random 0..1 nX5 array.

This page as a plain text file.
%I A218839 #6 Jul 23 2025 00:06:39
%S A218839 12,156,2050,26635,346501,4507281,58634265,762745363,9922198586,
%T A218839 129073371922,1679056577224,21842080049186,284133645307551,
%U A218839 3696164842194424,48081720559244098,625473146037672596
%N A218839 Unmatched value maps: number of nX5 binary arrays indicating the locations of corresponding elements not equal to any horizontal or antidiagonal neighbor in a random 0..1 nX5 array.
%C A218839 Column 5 of A218842
%H A218839 R. H. Hardin, <a href="/A218839/b218839.txt">Table of n, a(n) for n = 1..65</a>
%F A218839 Empirical: a(n) = 12*a(n-1) +6*a(n-2) +103*a(n-3) -128*a(n-4) -41*a(n-5) -630*a(n-6) -523*a(n-7) +1154*a(n-8) -93*a(n-9) +762*a(n-10) -787*a(n-11) -416*a(n-12) +549*a(n-13) -178*a(n-14) +35*a(n-15) +11*a(n-16) -7*a(n-17) for n>18
%e A218839 Some solutions for n=3
%e A218839 ..0..0..1..0..0....0..0..0..0..0....0..0..0..1..1....1..1..0..0..0
%e A218839 ..1..0..1..0..1....0..0..1..0..0....0..0..0..0..0....0..0..1..0..1
%e A218839 ..0..0..0..0..0....1..0..0..0..1....0..1..1..0..0....1..1..1..0..0
%K A218839 nonn
%O A218839 1,1
%A A218839 _R. H. Hardin_ Nov 07 2012