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 A232587 #6 Jul 23 2025 07:30:59 %S A232587 70,690,8104,93236,1079300,12486510,144506106,1672314806,19353375198, %T A232587 223972627480,2591990800908,29996594823464,347144643738454, %U A232587 4017436125487796,46492991691492538,538054174106467882 %N A232587 Number of (n+1)X(6+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. %C A232587 Column 6 of A232589 %H A232587 R. H. Hardin, <a href="/A232587/b232587.txt">Table of n, a(n) for n = 1..210</a> %F A232587 Empirical: a(n) = 12*a(n-1) +9*a(n-2) -167*a(n-3) -12*a(n-4) +939*a(n-5) -314*a(n-6) -2754*a(n-7) +2190*a(n-8) +4330*a(n-9) -6045*a(n-10) -2542*a(n-11) +7749*a(n-12) -2051*a(n-13) -3957*a(n-14) +2749*a(n-15) +541*a(n-16) -459*a(n-17) -6*a(n-18) -169*a(n-19) -4*a(n-20) -40*a(n-21) -2*a(n-22) +4*a(n-23) for n>27 %e A232587 Some solutions for n=3 %e A232587 ..2..1..0..1..2..1..2....0..1..0..1..0..1..2....0..1..2..1..0..1..2 %e A232587 ..0..1..2..1..0..1..2....2..1..2..1..2..1..0....0..1..2..1..0..1..2 %e A232587 ..0..1..0..1..0..1..2....0..1..2..1..0..1..0....0..1..0..1..0..1..2 %e A232587 ..2..1..2..1..0..1..0....0..1..0..1..2..1..2....2..1..2..1..2..1..0 %K A232587 nonn %O A232587 1,1 %A A232587 _R. H. Hardin_, Nov 26 2013