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 A207450 #12 Jun 23 2018 07:21:16 %S A207450 16,256,1008,2560,5200,9216,14896,22528,32400,44800,60016,78336, %T A207450 100048,125440,154800,188416,226576,269568,317680,371200,430416, %U A207450 495616,567088,645120,730000,822016,921456,1028608,1143760,1267200,1399216,1540096 %N A207450 Number of n X 5 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 0 1 vertically. %C A207450 Column 5 of A207453. %H A207450 R. H. Hardin, <a href="/A207450/b207450.txt">Table of n, a(n) for n = 1..210</a> %F A207450 Empirical: a(n) = 48*n^3 - 32*n^2. %F A207450 Conjectures from _Colin Barker_, Jun 23 2018: (Start) %F A207450 G.f.: 16*x*(1 + 12*x + 5*x^2) / (1 - x)^4. %F A207450 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n>4. %F A207450 (End). %e A207450 Some solutions for n=5: %e A207450 0 1 1 1 0 1 1 0 1 0 0 1 1 0 1 0 1 1 0 0 %e A207450 1 0 1 0 1 0 1 1 0 1 1 1 0 1 1 0 1 0 1 1 %e A207450 1 0 1 0 0 0 1 1 0 0 1 1 0 1 1 0 1 0 1 0 %e A207450 1 0 1 0 0 0 1 1 0 0 1 1 0 1 1 0 1 0 1 0 %e A207450 1 0 1 0 0 0 1 1 0 0 0 1 0 1 1 0 1 0 1 0 %Y A207450 Cf. A207453. %K A207450 nonn %O A207450 1,1 %A A207450 _R. H. Hardin_, Feb 17 2012