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.

A183683 Number of (n+1) X 5 binary arrays with every 2 X 2 subblock nonsingular.

Original entry on oeis.org

48, 208, 832, 3472, 14144, 58448, 239424, 986128, 4047680, 16650448, 68397888, 281218704, 1155579712, 4750209360, 19522035520, 80241997072, 329789811520, 1355498530256, 5571139502912, 22898117877648, 94112790021952
Offset: 1

Views

Author

R. H. Hardin, Jan 06 2011

Keywords

Comments

Column 4 of A183688.

Examples

			Some solutions for 3 X 5:
..0..1..1..1..1....1..1..1..0..1....1..1..0..1..0....1..0..1..1..0
..1..1..0..1..0....1..0..1..1..0....0..1..1..0..1....0..1..0..1..1
..0..1..1..0..1....0..1..0..1..1....1..1..0..1..0....1..1..1..0..1
		

Crossrefs

Cf. A183688.

Formula

Empirical: a(n) = 13*a(n-2) + 16*a(n-3).
Empirical g.f.: 16*x*(3 + 13*x + 13*x^2) / (1 - 13*x^2 - 16*x^3). - Colin Barker, Apr 04 2018