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.

A232581 Number of (n+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.

This page as a plain text file.
%I A232581 #7 Jul 23 2025 07:30:26
%S A232581 0,34,42,6406,14398,12486510,41969054,255585490674,1079163298316,
%T A232581 54986925928451542,282118997571150630,124284077001521518573820,
%U A232581 748107850423156991103192,2951299844035743073442451486916
%N A232581 Number of (n+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.
%C A232581 Diagonal of A232589
%H A232581 R. H. Hardin, <a href="/A232581/b232581.txt">Table of n, a(n) for n = 1..17</a>
%e A232581 Some solutions for n=5
%e A232581 ..0..1..2..0..1..2....2..1..2..0..1..2....2..1..2..1..0..2....0..1..2..0..1..2
%e A232581 ..2..0..1..0..1..0....0..1..2..0..1..0....0..1..0..2..1..0....0..1..2..0..1..2
%e A232581 ..1..2..1..2..1..0....2..0..1..0..1..2....0..1..0..2..1..0....2..0..1..0..1..2
%e A232581 ..1..0..1..2..1..0....1..2..1..2..1..2....2..1..0..2..1..2....1..2..1..0..1..0
%e A232581 ..1..2..1..0..1..0....1..0..1..0..1..2....0..2..1..0..1..2....1..0..1..0..1..2
%e A232581 ..1..0..1..2..1..0....1..2..1..0..1..0....1..0..1..2..1..0....1..2..1..0..1..2
%K A232581 nonn
%O A232581 1,2
%A A232581 _R. H. Hardin_, Nov 26 2013