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 A207483 #8 Mar 05 2018 05:46:25 %S A207483 6,36,82,177,408,942,2233,5348,12994,31873,78920,196862,494329, %T A207483 1248164,3166802,8067793,20626904,52898478,136020345,350558596, %U A207483 905277122,2341815073,6067027656,15738638142,40874569785,106260279044,276481264786 %N A207483 Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 1 0 vertically. %C A207483 Column 3 of A207488. %H A207483 R. H. Hardin, <a href="/A207483/b207483.txt">Table of n, a(n) for n = 1..210</a> %F A207483 Empirical: a(n) = 7*a(n-1) - 13*a(n-2) - 10*a(n-3) + 48*a(n-4) - 16*a(n-5) - 47*a(n-6) + 25*a(n-7) + 13*a(n-8) - 6*a(n-9) for n>10. %F A207483 Empirical g.f.: x*(6 - 6*x - 92*x^2 + 131*x^3 + 307*x^4 - 425*x^5 - 365*x^6 + 401*x^7 + 131*x^8 - 82*x^9) / ((1 - x)*(1 + x)*(1 - 2*x)*(1 - 3*x + x^2)*(1 - x - x^2)*(1 - x - 3*x^2)). - _Colin Barker_, Mar 05 2018 %e A207483 Some solutions for n=4: %e A207483 ..1..1..0....1..0..1....0..0..1....0..1..0....0..0..1....1..1..1....1..0..0 %e A207483 ..1..0..1....0..0..1....0..0..1....1..0..1....0..1..0....1..1..0....1..0..1 %e A207483 ..1..0..0....0..0..1....0..0..1....0..1..0....0..0..1....1..1..1....1..0..0 %e A207483 ..1..1..1....0..0..1....1..1..1....1..0..0....0..1..0....1..1..0....1..0..1 %Y A207483 Cf. A207488. %K A207483 nonn %O A207483 1,1 %A A207483 _R. H. Hardin_, Feb 18 2012