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 A196450 #8 May 09 2018 08:16:47 %S A196450 3,6,14,30,67,146,320,706,1550,3403,7481,16443,36131,79399,174500, %T A196450 383499,842796,1852205,4070612,8945988,19660603,43208249,94959144, %U A196450 208692464,458645240,1007969053,2215223460,4868418432,10699372182,23514119454 %N A196450 Number of n X 2 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 3,0,2,4,1 for x=0,1,2,3,4. %C A196450 Every 0 is next to 0 3's, every 1 is next to 1 0's, every 2 is next to 2 2's, every 3 is next to 3 4's, every 4 is next to 4 1's. %C A196450 Column 2 of A196456. %H A196450 R. H. Hardin, <a href="/A196450/b196450.txt">Table of n, a(n) for n = 1..200</a> %F A196450 Empirical: a(n) = 2*a(n-1) +3*a(n-3) -2*a(n-4) -3*a(n-5) -5*a(n-6) -a(n-7). %F A196450 Empirical g.f.: x*(3 + 2*x^2 - 7*x^3 - 5*x^4 - 9*x^5 - x^6) / (1 - 2*x - 3*x^3 + 2*x^4 + 3*x^5 + 5*x^6 + x^7). - _Colin Barker_, May 09 2018 %e A196450 Some solutions for n=4: %e A196450 ..1..0....2..2....1..0....1..1....1..0....0..1....1..0....2..2....2..2....0..0 %e A196450 ..1..0....2..2....1..0....0..0....2..2....2..2....2..2....2..2....2..2....0..0 %e A196450 ..1..0....0..1....1..1....0..0....2..2....2..2....2..2....1..0....0..0....0..0 %e A196450 ..1..0....0..1....0..1....1..1....0..0....0..1....0..1....1..0....1..1....1..1 %Y A196450 Cf. A196456. %K A196450 nonn %O A196450 1,1 %A A196450 _R. H. Hardin_, Oct 02 2011