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.

A206468 Number of (n+1)X5 0..2 arrays with every 2X2 subblock having zero permanent.

Original entry on oeis.org

1849, 106891, 1896129, 68352739, 1693734025, 52552339515, 1457044540561, 43214597865811, 1240051361495769, 36294544907153707, 1052106476736321889, 30674877583244503491, 891844034416624515625, 25973093752500918767899
Offset: 1

Views

Author

R. H. Hardin Feb 08 2012

Keywords

Comments

Column 4 of A206472

Examples

			Some solutions for n=4
..1..1..1..2..1....0..0..2..1..1....0..0..2..2..2....2..0..0..1..1
..0..0..0..0..0....2..0..0..0..0....1..0..0..0..0....2..0..0..0..0
..1..2..0..1..2....2..0..1..2..1....1..0..0..2..1....0..0..2..2..0
..0..0..0..0..0....0..0..0..0..0....0..0..0..0..0....0..0..0..0..0
..0..1..2..0..1....1..0..1..2..0....2..1..0..0..2....2..2..2..1..2
		

Formula

Empirical: a(n) = 39*a(n-1) -11348*a(n-3) +76272*a(n-4) +429792*a(n-5) -3994496*a(n-6) +37171200*a(n-8) -43614208*a(n-9)