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.

A184557 Number of (n+1)X3 0..2 arrays with no 2X2 subblock summing to less than 4.

Original entry on oeis.org

336, 5736, 91157, 1486258, 24057629, 390354307, 6329171799, 102644935902, 1664547601646, 26993866274311, 437754652218346, 7099004652318411, 115123459690848087, 1866939760799593583, 30275877954690891176
Offset: 1

Views

Author

R. H. Hardin Jan 17 2011

Keywords

Comments

Column 2 of A184564

Examples

			Some solutions for 5X3
..0..0..1....0..0..2....0..1..0....0..0..0....0..1..1....0..1..1....0..0..2
..2..2..1....2..2..0....2..2..1....2..2..2....2..2..2....2..2..0....2..2..2
..1..1..2....0..2..0....2..0..2....2..1..1....0..2..0....0..2..0....1..1..1
..1..1..1....1..2..2....1..1..1....0..2..1....2..1..2....1..2..1....2..2..2
..1..2..2....1..2..0....2..0..2....2..2..1....2..1..0....2..1..0....2..1..1
		

Formula

Empirical: a(n)=15*a(n-1)+43*a(n-2)-381*a(n-3)-42*a(n-4)+1696*a(n-5)-590*a(n-6)-2216*a(n-7)+1085*a(n-8)+858*a(n-9)-456*a(n-10)-88*a(n-11)+48*a(n-12)