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.

A229842 Number of nX3 0..2 arrays x(i,j) with each element horizontally or vertically next to at least one element with value 2-x(i,j).

Original entry on oeis.org

3, 81, 987, 13401, 178311, 2381469, 31783299, 424240833, 5662582239, 75582071565, 1008840783171, 13465626160209, 179734091085543, 2399022766771749, 32021249796760479, 427407548197383945, 5704874525707845543
Offset: 1

Views

Author

R. H. Hardin, Oct 01 2013

Keywords

Comments

Column 3 of A229847

Examples

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

Formula

Empirical: a(n) = 10*a(n-1) +44*a(n-2) +20*a(n-3) -122*a(n-4) -303*a(n-5) -129*a(n-6) +244*a(n-7) +526*a(n-8) -74*a(n-9) -220*a(n-10) -225*a(n-11) +96*a(n-12) +172*a(n-13) -50*a(n-14) +44*a(n-15)