cp's OEIS Frontend

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.

A232586 Number of (n+1)X(5+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.

This page as a plain text file.
%I A232586 #6 Jul 23 2025 07:30:52
%S A232586 20,108,606,3002,14398,66950,306022,1382638,6200520,27671244,
%T A232586 123093664,546418140,2422183000,10727201704,47478696368,210055317910,
%U A232586 929074602120,4108554199540,18166666165648,80320554722730,355103563888676
%N A232586 Number of (n+1)X(5+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 A232586 Column 5 of A232589
%H A232586 R. H. Hardin, <a href="/A232586/b232586.txt">Table of n, a(n) for n = 1..210</a>
%F A232586 Empirical: a(n) = 9*a(n-1) -22*a(n-2) -8*a(n-3) +89*a(n-4) -75*a(n-5) -75*a(n-6) +136*a(n-7) -21*a(n-8) -51*a(n-9) +2*a(n-10) +24*a(n-11) -3*a(n-13) -a(n-14)
%e A232586 Some solutions for n=5
%e A232586 ..2..1..0..2..1..0....2..1..0..1..2..1....0..1..2..1..0..2....2..1..0..1..0..1
%e A232586 ..0..1..0..2..1..0....2..1..2..1..0..2....2..1..0..2..1..0....2..1..2..1..2..1
%e A232586 ..2..1..0..2..1..0....2..1..0..2..1..0....0..2..1..0..1..2....0..1..2..1..0..1
%e A232586 ..2..1..0..2..1..0....2..1..0..2..1..2....1..0..1..0..1..2....2..1..2..1..2..0
%e A232586 ..0..2..1..0..1..0....0..2..1..0..1..0....1..2..1..2..1..0....0..1..2..0..1..0
%e A232586 ..1..0..1..2..1..0....1..0..1..2..1..0....1..0..1..2..1..0....2..0..1..2..1..0
%K A232586 nonn
%O A232586 1,1
%A A232586 _R. H. Hardin_, Nov 26 2013