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 A218059 #7 Mar 09 2018 19:33:03 %S A218059 4,18,74,308,1282,5338,22228,92562,385450,1605108,6684066,27834106, %T A218059 115908116,482670130,2009958090,8369963828,34854604610,145143215386, %U A218059 604412335444,2516922821842,10481090672106,43645860224116 %N A218059 Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal or antidiagonal neighbors in a random 0..1 n X 3 array. %C A218059 Column 3 of A218064. %H A218059 R. H. Hardin, <a href="/A218059/b218059.txt">Table of n, a(n) for n = 1..210</a> %F A218059 Empirical: a(n) = 5*a(n-1) - 3*a(n-2) - 2*a(n-3). %F A218059 Empirical g.f.: 2*x*(2 - x - 2*x^2) / (1 - 5*x + 3*x^2 + 2*x^3). - _Colin Barker_, Mar 09 2018 %e A218059 Some solutions for n=3: %e A218059 ..0..0..1....1..1..0....1..0..0....0..0..1....0..0..0....1..0..1....0..0..1 %e A218059 ..1..0..0....0..0..0....1..0..1....1..0..0....1..0..1....0..0..1....1..0..1 %e A218059 ..0..0..1....0..0..0....1..1..1....1..0..1....1..1..1....1..0..0....0..0..0 %Y A218059 Cf. A218064. %K A218059 nonn %O A218059 1,1 %A A218059 _R. H. Hardin_, Oct 19 2012