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.

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.

Original entry on oeis.org

12, 351, 8173, 193116, 4560446, 107701719, 2543481662, 60067211485, 1418553120783, 33500701298909, 791156061757424, 18684024494159794, 441243879877927791, 10420461699586486378, 246090715301965835785
Offset: 1

Views

Author

R. H. Hardin Nov 19 2012

Keywords

Comments

Column 5 of A219410

Examples

			Some solutions for n=3
..1..0..0..1..1....1..1..0..1..1....0..0..1..1..1....1..1..0..0..1
..1..1..0..0..0....1..0..0..0..0....1..1..0..0..1....0..0..0..0..1
..1..0..1..1..1....1..0..0..0..0....1..0..1..0..0....0..0..0..0..0
		

Formula

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