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 A207584 #8 Mar 05 2018 09:28:04 %S A207584 6,36,60,144,312,612,1250,2516,4968,9796,19256,37740,73704,143810, %T A207584 280340,545664,1061676,2064584,4012968,7798252,15150258,29428972, %U A207584 57157720,111001924,215555184,418562876,812728688,1578038530,3063930012 %N A207584 Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically. %C A207584 Column 3 of A207589. %H A207584 R. H. Hardin, <a href="/A207584/b207584.txt">Table of n, a(n) for n = 1..210</a> %F A207584 Empirical: a(n) = a(n-1) + a(n-2) + 4*a(n-3) - 2*a(n-4) - a(n-5) - 8*a(n-6) + a(n-7) - 3*a(n-8) + 3*a(n-9) -2 *a(n-10) - a(n-12) for n>14. %F A207584 Empirical g.f.: 2*x*(3 + 15*x + 9*x^2 + 12*x^3 - 12*x^4 - 3*x^5 - 23*x^6 + 18*x^7 - 8*x^8 + 15*x^9 - 12*x^10 + 3*x^11 - 3*x^12 + 2*x^13) / ((1 - x - x^3)*(1 - x^2 - 4*x^3 - 2*x^4 - 2*x^5 + 2*x^6 - x^7 - x^9)). - _Colin Barker_, Mar 05 2018 %e A207584 Some solutions for n=4: %e A207584 ..1..1..1....0..1..1....0..1..1....0..1..0....1..1..1....1..1..0....1..0..0 %e A207584 ..0..1..0....1..0..1....1..0..1....1..0..0....1..0..0....0..1..0....1..1..1 %e A207584 ..1..0..0....0..1..0....1..1..0....0..1..0....0..1..1....1..0..0....0..1..1 %e A207584 ..0..1..0....1..1..1....0..1..1....1..0..0....1..1..0....0..1..0....1..0..0 %Y A207584 Cf. A207589. %K A207584 nonn %O A207584 1,1 %A A207584 _R. H. Hardin_, Feb 19 2012