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.

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

Original entry on oeis.org

21, 1261, 57097, 2633596, 121641579, 5618116265, 259468310384, 11983486642214, 553453107750115, 25561051456876291, 1180528707338785094, 54522328912450097473, 2518095766994664668337, 116297422017630310505820
Offset: 1

Views

Author

R. H. Hardin Nov 19 2012

Keywords

Comments

Column 6 of A219410

Examples

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

Formula

Empirical: a(n) = 21*a(n-1) +950*a(n-2) +9306*a(n-3) +26031*a(n-4) -50016*a(n-5) -214765*a(n-6) +276749*a(n-7) +349461*a(n-8) -523220*a(n-9) -71125*a(n-10) +294741*a(n-11) -112428*a(n-12) +11664*a(n-13) for n>14