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 A221329 #8 Aug 05 2018 08:21:43 %S A221329 1,17,119,866,6328,46211,337274,2460918,17953576,130970758,955393448, %T A221329 6969190236,50836821440,370827923908,2704988609708,19731401249156, %U A221329 143929610463264,1049886222652688,7658333144969252,55863255070913284 %N A221329 Number of 2 X n arrays of occupancy after each element stays put or moves to some horizontal or antidiagonal neighbor, with no occupancy greater than 2. %C A221329 Row 2 of A221328. %H A221329 R. H. Hardin, <a href="/A221329/b221329.txt">Table of n, a(n) for n = 1..210</a> %F A221329 Empirical: a(n) = 11*a(n-1) - 27*a(n-2) - a(n-3) + 8*a(n-4) - 16*a(n-5) - 6*a(n-6) + 2*a(n-7) for n>9. %F A221329 Empirical g.f.: x*(1 + 6*x - 41*x^2 + 17*x^3 + 24*x^4 - 16*x^5 + x^6 + 5*x^7 - x^8) / (1 - 11*x + 27*x^2 + x^3 - 8*x^4 + 16*x^5 + 6*x^6 - 2*x^7). - _Colin Barker_, Aug 05 2018 %e A221329 Some solutions for n=3: %e A221329 ..0..1..0....1..1..1....2..0..1....2..1..0....0..1..1....2..0..2....1..0..1 %e A221329 ..1..2..2....2..0..1....1..0..2....2..1..0....1..1..2....0..1..1....1..1..2 %Y A221329 Cf. A221328. %K A221329 nonn %O A221329 1,2 %A A221329 _R. H. Hardin_, Jan 11 2013