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 A232591 #7 Oct 05 2018 12:00:18 %S A232591 2,34,12,152,108,690,744,3232,4516,15592,25724,76914,141516,385622, %T A232591 762648,1955944,4058152,10001440,21421592,51425362,112496648, %U A232591 265415854,588810972,1373336224,3075128652,7118096080,16037159652,36935382354 %N A232591 Number of (2+1) X (n+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or antidiagonally, with no adjacent elements equal. %H A232591 R. H. Hardin, <a href="/A232591/b232591.txt">Table of n, a(n) for n = 1..210</a> %F A232591 Empirical: a(n) = 5*a(n-2) + 4*a(n-3) - 3*a(n-4) - 12*a(n-5) - 3*a(n-6) + 6*a(n-7) + 6*a(n-8) + 2*a(n-9) for n>10. %F A232591 Empirical g.f.: x*(1 + 17*x + x^2 - 13*x^3 - 41*x^4 + 4*x^5 + 23*x^6 + 20*x^7 + 2*x^8 - x^9) / (1 - 5*x^2 - 4*x^3 + 3*x^4 + 12*x^5 + 3*x^6 - 6*x^7 - 6*x^8 - 2*x^9). - _Colin Barker_, Oct 05 2018 %e A232591 Some solutions for n=7: %e A232591 ..2..1..0..2..1..0..1..0....0..1..2..0..1..0..1..2....2..1..0..1..2..0..1..2 %e A232591 ..2..1..0..2..1..2..1..0....2..0..1..2..1..2..1..0....2..1..2..1..2..0..1..2 %e A232591 ..0..2..1..0..1..2..1..2....1..2..1..0..1..0..1..2....0..1..0..1..2..0..1..2 %Y A232591 Row 2 of A232589. %K A232591 nonn %O A232591 1,1 %A A232591 _R. H. Hardin_, Nov 26 2013