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.

A267668 Number of 3Xn 0..1 arrays with every repeated value in every row unequal to the previous repeated value, and in every column equal to the previous repeated value, and new values introduced in row-major sequential order.

Original entry on oeis.org

4, 32, 108, 500, 1372, 5324, 13500, 48668, 119164, 415292, 1000188, 3429500, 8193532, 27871484, 66325500, 224727548, 533731324, 1804870652, 4282396668, 14467221500, 34309431292, 115850907644, 274676629500, 927260024828
Offset: 1

Views

Author

R. H. Hardin, Jan 19 2016

Keywords

Comments

Row 3 of A267667.

Examples

			Some solutions for n=8
..0..1..0..1..0..1..0..1....0..1..0..1..0..0..1..1....0..1..0..1..0..1..0..1
..1..0..1..0..1..0..1..1....0..0..1..0..1..1..0..1....0..0..1..0..1..0..1..1
..1..1..0..1..0..0..1..0....1..0..1..0..1..1..0..1....1..0..1..1..0..0..1..0
		

Crossrefs

Cf. A267667.

Formula

Empirical: a(n) = a(n-1) +14*a(n-2) -14*a(n-3) -56*a(n-4) +56*a(n-5) +64*a(n-6) -64*a(n-7)