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.

A232594 Number of (5+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 A232594 #6 Jul 23 2025 07:31:38
%S A232594 10,1686,332,41328,14398,1079300,595304,28339640,20864698,745382818,
%T A232594 692444826,19631615242,21942354104,517768940660,675100038700,
%U A232594 13674459254626,20329795464920,361635903700296,602407966781578
%N A232594 Number of (5+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 A232594 Row 5 of A232589
%H A232594 R. H. Hardin, <a href="/A232594/b232594.txt">Table of n, a(n) for n = 1..210</a>
%e A232594 Some solutions for n=6
%e A232594 ..0..1..2..1..0..1..0....0..1..2..1..0..1..0....0..1..2..1..0..1..2
%e A232594 ..0..1..0..1..2..1..2....0..1..2..1..2..1..2....0..1..2..1..2..1..2
%e A232594 ..0..1..2..1..0..1..2....0..1..0..1..0..1..0....0..1..0..1..0..1..0
%e A232594 ..0..1..2..1..2..1..0....0..1..0..1..2..1..0....2..1..2..1..2..1..2
%e A232594 ..2..1..2..1..2..1..0....2..1..0..1..0..1..0....2..1..0..1..2..1..2
%e A232594 ..0..1..0..1..0..1..2....2..1..2..1..2..1..2....0..1..2..1..0..1..2
%K A232594 nonn
%O A232594 1,1
%A A232594 _R. H. Hardin_, Nov 26 2013