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.
%I A219407 #6 Jul 23 2025 00:25:31 %S A219407 12,351,8173,193116,4560446,107701719,2543481662,60067211485, %T A219407 1418553120783,33500701298909,791156061757424,18684024494159794, %U A219407 441243879877927791,10420461699586486378,246090715301965835785 %N A219407 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..2 nX5 array. %C A219407 Column 5 of A219410 %H A219407 R. H. Hardin, <a href="/A219407/b219407.txt">Table of n, a(n) for n = 1..210</a> %F A219407 Empirical: a(n) = 12*a(n-1) +230*a(n-2) +999*a(n-3) +1175*a(n-4) -1025*a(n-5) -1129*a(n-6) +1240*a(n-7) -405*a(n-8) +45*a(n-9) for n>10 %e A219407 Some solutions for n=3 %e A219407 ..1..0..0..1..1....1..1..0..1..1....0..0..1..1..1....1..1..0..0..1 %e A219407 ..1..1..0..0..0....1..0..0..0..0....1..1..0..0..1....0..0..0..0..1 %e A219407 ..1..0..1..1..1....1..0..0..0..0....1..0..1..0..0....0..0..0..0..0 %K A219407 nonn %O A219407 1,1 %A A219407 _R. H. Hardin_ Nov 19 2012