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 A232333 #8 Oct 04 2018 11:50:23 %S A232333 16,162,1470,13170,117690,1047700,9298730,82332898,727588212, %T A232333 6419787202,56572605706,498017769108,4380455260922,38503151114834, %U A232333 338244048166260,2970058795869778,26069751578988858,228757355654899732 %N A232333 Number of n X 6 0..2 arrays with every 0 next to a 1 and every 1 next to a 2 horizontally or antidiagonally, with no adjacent elements equal. %H A232333 R. H. Hardin, <a href="/A232333/b232333.txt">Table of n, a(n) for n = 1..210</a> %F A232333 Empirical: a(n) = 16*a(n-1) -60*a(n-2) -47*a(n-3) +92*a(n-4) +448*a(n-5) +448*a(n-6) +256*a(n-7) for n>9. %F A232333 Empirical g.f.: 2*x*(8 - 47*x - 81*x^2 + 61*x^3 + 656*x^4 + 939*x^5 + 468*x^6 - 112*x^7 - 64*x^8) / (1 - 16*x + 60*x^2 + 47*x^3 - 92*x^4 - 448*x^5 - 448*x^6 - 256*x^7). - _Colin Barker_, Oct 04 2018 %e A232333 Some solutions for n=4: %e A232333 ..0..1..2..0..1..2....2..1..2..0..1..2....2..1..2..1..0..2....2..0..1..2..0..2 %e A232333 ..2..0..1..2..1..2....2..0..1..2..1..2....2..1..0..1..0..2....1..2..0..1..0..2 %e A232333 ..1..2..1..2..0..1....1..2..1..0..1..2....0..1..2..1..0..1....0..1..2..1..0..2 %e A232333 ..1..2..0..1..2..1....1..2..1..0..1..0....0..1..0..1..2..1....2..1..2..1..0..2 %Y A232333 Column 6 of A232335. %K A232333 nonn %O A232333 1,1 %A A232333 _R. H. Hardin_, Nov 22 2013