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.

A233159 Number of 6Xn 0..2 arrays with no element x(i,j) adjacent to value 2-x(i,j) horizontally or antidiagonally.

Original entry on oeis.org

729, 6144, 93312, 1417176, 22692312, 367125912, 5986203912, 97881138720, 1602873102744, 26263615856184, 430448561176896, 7055528832767376, 115652113962870744, 1895759819221508496, 31075287281252187264
Offset: 1

Views

Author

R. H. Hardin, Dec 05 2013

Keywords

Comments

Row 6 of A233155

Examples

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

Formula

Empirical: a(n) = 30*a(n-1) -283*a(n-2) +1038*a(n-3) -573*a(n-4) -6705*a(n-5) +21056*a(n-6) -27636*a(n-7) +17216*a(n-8) -4128*a(n-9) for n>15