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.

A219418 Unchanging value maps: number of n X 5 binary arrays indicating the locations of corresponding elements unequal to no horizontal or antidiagonal neighbor in a random 0..2 n X 5 array.

Original entry on oeis.org

12, 160, 2121, 28154, 372560, 4934366, 65352789, 865523957, 11462977378, 151815415029, 2010639231109, 26628853182336, 352671832205165, 4670776468884680, 61859640739887596, 819267455394261112
Offset: 1

Views

Author

R. H. Hardin, Nov 19 2012

Keywords

Comments

Column 5 of A219421.

Examples

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

Formula

Empirical: a(n) = 14*a(n-1) -17*a(n-2) +117*a(n-3) -355*a(n-4) +550*a(n-5) -1954*a(n-6) +1579*a(n-7) -1059*a(n-8) -1065*a(n-9) +1097*a(n-10) +8*a(n-11) -153*a(n-12) +45*a(n-13) -6*a(n-14) for n>15.