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.
%I A183682 #9 Feb 27 2018 07:11:10 %S A183682 12,32,80,208,528,1360,3472,8912,22800,58448,149648,383440,982032, %T A183682 2515792,6443920,16507088,42282768,108311120,277442192,710686672, %U A183682 1820455440,4663202128,11945023888,30597832400,78377927952,200769257552 %N A183682 Number of (n+1) X 3 binary arrays with every 2 X 2 subblock nonsingular. %C A183682 Column 2 of A183688. %H A183682 R. H. Hardin, <a href="/A183682/b183682.txt">Table of n, a(n) for n = 1..200</a> %F A183682 Empirical: a(n) = a(n-1) + 4*a(n-2). %F A183682 Conjectures from _Colin Barker_, Feb 27 2018: (Start) %F A183682 G.f.: 4*x*(3 + 5*x) / (1 - x - 4*x^2). %F A183682 a(n) = (2^(-1-n)*((1-sqrt(17))^n*(-19+5*sqrt(17)) + (1+sqrt(17))^n*(19+5*sqrt(17)))) / sqrt(17). %F A183682 (End) %e A183682 Some solutions for 5 X 3: %e A183682 ..0..1..1....0..1..1....0..1..0....1..1..1....1..1..0....1..1..0....1..0..1 %e A183682 ..1..0..1....1..0..1....1..0..1....1..0..1....1..0..1....1..0..1....1..1..0 %e A183682 ..1..1..0....0..1..0....0..1..0....1..1..0....1..1..1....0..1..1....0..1..1 %e A183682 ..0..1..1....1..0..1....1..0..1....1..0..1....0..1..0....1..0..1....1..1..0 %e A183682 ..1..1..0....0..1..0....0..1..0....0..1..0....1..1..1....1..1..0....1..0..1 %Y A183682 Cf. A183688. %K A183682 nonn %O A183682 1,1 %A A183682 _R. H. Hardin_, Jan 06 2011