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 A229841 #8 Mar 17 2018 05:45:33 %S A229841 3,15,81,423,2247,11925,63291,335943,1783137,9464655,50237151, %T A229841 266652213,1415355027,7512519135,39875467761,211653760983, %U A229841 1123430446167,5963021689365,31650938239371,167999035324503,891716879181057 %N A229841 Number of n X 2 0..2 arrays x(i,j) with each element horizontally or vertically next to at least one element with value 2-x(i,j). %C A229841 Column 2 of A229847. %H A229841 R. H. Hardin, <a href="/A229841/b229841.txt">Table of n, a(n) for n = 1..210</a> %F A229841 Empirical: a(n) = 5*a(n-1) + 2*a(n-2) - a(n-3) - 5*a(n-4). %F A229841 Empirical g.f.: 3*x*(1 - 3*x^3) / ((1 - x)*(1 - 4*x - 6*x^2 - 5*x^3)). - _Colin Barker_, Mar 17 2018 %e A229841 Some solutions for n=3: %e A229841 ..0..2....2..1....2..0....0..2....0..2....2..0....1..1....1..1....2..0....0..1 %e A229841 ..2..0....0..1....0..0....1..1....2..1....2..0....0..1....2..2....1..1....2..1 %e A229841 ..0..2....2..1....2..2....2..0....0..1....1..1....2..1....0..0....0..2....1..1 %Y A229841 Cf. A229847. %K A229841 nonn %O A229841 1,1 %A A229841 _R. H. Hardin_, Oct 01 2013