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 A208376 #9 Jul 02 2018 05:46:01 %S A208376 16,256,704,1344,2176,3200,4416,5824,7424,9216,11200,13376,15744, %T A208376 18304,21056,24000,27136,30464,33984,37696,41600,45696,49984,54464, %U A208376 59136,64000,69056,74304,79744,85376,91200,97216,103424,109824,116416,123200,130176 %N A208376 Number of n X 5 0..1 arrays avoiding 0 0 0 and 1 1 1 horizontally and 0 0 1 and 1 0 1 vertically. %C A208376 Column 5 of A208379. %H A208376 R. H. Hardin, <a href="/A208376/b208376.txt">Table of n, a(n) for n = 1..210</a> %F A208376 Empirical: a(n) = 96*n^2 - 32*n - 64 for n>1. %F A208376 Conjectures from _Colin Barker_, Jul 02 2018: (Start) %F A208376 G.f.: 16*x*(1 + 13*x - x^2 - x^3) / (1 - x)^3. %F A208376 a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>4. %F A208376 (End) %e A208376 Some solutions for n=4: %e A208376 ..1..1..0..0..1....0..1..0..1..1....1..0..1..0..0....1..1..0..0..1 %e A208376 ..0..0..1..1..0....1..0..1..0..1....1..0..1..1..0....1..0..1..0..0 %e A208376 ..0..0..1..0..0....0..0..1..0..0....0..0..1..0..0....1..0..1..0..0 %e A208376 ..0..0..1..0..0....0..0..1..0..0....0..0..1..0..0....0..0..1..0..0 %Y A208376 Cf. A208379. %K A208376 nonn %O A208376 1,1 %A A208376 _R. H. Hardin_, Feb 25 2012